Doggo Recoloring 【简单思维】

题目链接：https://cn.vjudge.net/contest/280309#problem/I

题目描述

Panic is rising in the committee for doggo standardization — the puppies of the new brood have been born multi-colored! In total there are 26 possible colors of puppies in the nature and they are denoted by letters from 'a' to 'z' inclusive.

The committee rules strictly prohibit even the smallest diversity between doggos and hence all the puppies should be of the same color. Thus Slava, the committee employee, has been assigned the task to recolor some puppies into other colors in order to eliminate the difference and make all the puppies have one common color.

Unfortunately, due to bureaucratic reasons and restricted budget, there's only one operation Slava can perform: he can choose a color xx such that there are currently at least two puppies of color xx and recolor all puppies of the color xx into some arbitrary color yy. Luckily, this operation can be applied multiple times (including zero).

For example, if the number of puppies is 77 and their colors are represented as the string "abababc", then in one operation Slava can get the results "zbzbzbc", "bbbbbbc", "aaaaaac", "acacacc" and others. However, if the current color sequence is "abababc", then he can't choose xx='c' right now, because currently only one puppy has the color 'c'.

Help Slava and the committee determine whether it is possible to standardize all the puppies, i.e. after Slava's operations all the puppies should have the same color.

Input

The first line contains a single integer nn (1≤n≤1051≤n≤105) — the number of puppies.

The second line contains a string ss of length nn consisting of lowercase Latin letters, where the ii-th symbol denotes the ii-th puppy's color.

Output

If it's possible to recolor all puppies into one color, print "Yes".

Otherwise print "No".

Output the answer without quotation signs.

Examples

Input

6
aabddc

Output

Yes

Input

3
abc

Output

No

Input

3
jjj

Output

Yes

Note

In the first example Slava can perform the following steps:

1. take all puppies of color 'a' (a total of two) and recolor them into 'b';
2. take all puppies of color 'd' (a total of two) and recolor them into 'c';
3. take all puppies of color 'b' (three puppies for now) and recolor them into 'c'.

In the second example it's impossible to recolor any of the puppies.

In the third example all the puppies' colors are the same; thus there's no need to recolor anything.

题意及思路

题目扯了那么多，其实就是找给出的字符串中有没有相同的字符，只要某个字符的出现次数>=2或者n=1就可以完成要求输出Yes，否则就输出No。

另外，读字符串cin能过cin.getline（）就过不了是为什么？？？

AC代码

#include <iostream>
#include <cstring>
#include <cstdlib>
using namespace std;
const int maxn = 1e5+5;
char a[maxn];
int book[30];
int main()
{
	int n;
	bool flag = false;
	cin >> n >> a;
	//getchar();
	//cin.getline(a,n);			// 这东西有毒 
	memset(book,0,sizeof book);
	//int len=strlen(a);
	for(int i=0;i<n;i++) {
		book[a[i]-'a']++;
		if(book[a[i]-'a'] >= 2) {
			flag = true;
			break;
		}
	}
	if(flag || n==1)
		cout << "Yes\n";
	else
		cout << "No\n";
}