codeforces#505--A Doggo Recoloring

A. Doggo Recoloring

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 xxsuch 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

Copy

6
aabddc

output

Copy

Yes

input

Copy

3
abc

output

Copy

No

input

Copy

3
jjj

output

Copy

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.

只要有一个字母出现了两次就可以了

注意要特判n=1的时候

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#define inf 0x3f3f3f3f
using namespace std;

int n;
const int maxn = 1e5 + 5;
int puppy[30];
char s[maxn];

int main()
{
    while(scanf("%d", &n) != EOF){
        cin>>s;
        memset(puppy, 0, sizeof(puppy));
        bool flag = false;
        for(int i = 0; i < strlen(s); i++){
            puppy[s[i] - 'a']++;
            if(puppy[s[i] - 'a'] >= 2){
                flag = true;
                break;
            }
        }
        if(flag || n == 1){
            printf("Yes\n");
        }
        else{
            printf("No\n");
        }
    }
	return 0;
}