# Codeforces Round #352 (Div. 2)（B）思维

B. Different is Good
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

A wise man told Kerem "Different is good" once, so Kerem wants all things in his life to be different.

Kerem recently got a string s consisting of lowercase English letters. Since Kerem likes it when things are different, he wants allsubstrings of his string s to be distinct. Substring is a string formed by some number of consecutive characters of the string. For example, string "aba" has substrings "" (empty substring), "a", "b", "a", "ab", "ba", "aba".

If string s has at least two equal substrings then Kerem will change characters at some positions to some other lowercase English letters. Changing characters is a very tiring job, so Kerem want to perform as few changes as possible.

Your task is to find the minimum number of changes needed to make all the substrings of the given string distinct, or determine that it is impossible.

Input

The first line of the input contains an integer n (1 ≤ n ≤ 100 000) — the length of the string s.

The second line contains the string s of length n consisting of only lowercase English letters.

Output

If it's impossible to change the string s such that all its substring are distinct print -1. Otherwise print the minimum required number of changes.

Examples
input
2
aa

output
1

input
4
koko

output
2

input
5
murat

output
0

Note

In the first sample one of the possible solutions is to change the first character to 'b'.

In the second sample, one may change the first character to 'a' and second character to 'b', so the string becomes "abko".

import java.lang.*;
import java.util.Scanner;

public class Main {

public static void main(String[] args) {
// TODO 自动生成的方法存根
Scanner in = new Scanner(System.in);
String s = new String();
String n = new String();
n=in.nextLine();
s=in.nextLine();
//System.out.println(n+" "+s);
if(s.length()>26)
{
System.out.println(-1);
}
else
{
int cnt[] = new int[300];
for(int i=0;i<150;i++)
{
cnt[i]=0;
}
for(int i=0;i<s.length();i++)
{
cnt[s.charAt(i)]++;
}
int ans=0;
for(int i=0;i<150;i++)
{
if(cnt[i]>0)
{
ans+=(cnt[i]-1);
}
}
System.out.println(ans);
}
}
}

#### Educational Codeforces Round 38 (Rated for Div. 2) B. Run For Your Prize

2018-02-17 13:35:37

#### Codeforces Round #444 (Div. 2)-贪心&尺取-Ratings and Reality Shows

2017-11-11 20:11:11

#### Codeforces Round #448 (Div. 2) ABC

2017-11-27 14:47:02

#### Educational Codeforces Round 36 (Rated for Div. 2) 题解

2018-01-13 23:16:24

#### Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2) B. Messages 题意+解析+ 答案

2018-04-18 07:08:14

#### Codeforces Round #482 (Div. 2)

2018-05-15 12:51:24

#### Codeforces Educational Codeforces Round 41 (Rated for Div. 2) B. Lecture Sleep

2018-04-05 10:35:27

#### Educational Codeforces Round 46 (Rated for Div. 2) B - Light It Up

2018-06-28 08:42:52

#### Codeforces Round #459 (Div. 2)The Monster[匹配问题]

2018-01-30 15:20:19

#### Codeforces Round #471 div.2 ABC题解

2018-03-24 14:16:58