codeforces 672B Different is Good

点击打开链接

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 all substringsof 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

Copy

2
aa

output

Copy

1

input

Copy

4
koko

output

Copy

2

input

Copy

5
murat

output

Copy

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".

题意：给出一个n，和有n个字符的串，求改变多少个字符能使所有子串不同，如果不能满足条件，输出-1，否则输出修改字符的个数

思路：使每个字符都不同，千万要注意小写字母只有26个，所以大于26就只能-1了，忽略了这个错了几次

#include<bits/stdc++.h>  
using namespace std;  
typedef long long ll;  
const int inf = 0x3f3f3f3f;  
int main()   
{  
    //freopen("in.txt","r",stdin);
    set<char>ff;
    int n;
    string s;
    cin>>n;
    cin>>s;
    for(int i=0;i<n;i++)
    {
    	ff.insert(s[i]);
    }
    if(n-ff.size()<26&&n<=26)  
    	cout<<n-ff.size()<<endl;
    else
    	cout<<-1<<endl;
    return 0;  
}