F - Diverse Substring

You are given a string ss, consisting of nn lowercase Latin letters.

A substring of string ss is a continuous segment of letters from ss. For example, "defor" is a substring of "codeforces" and "fors" is not.

The length of the substring is the number of letters in it.

Let's call some string of length nn diverse if and only if there is no letter to appear strictly more than n2n2 times. For example, strings "abc" and "iltlml" are diverse and strings "aab" and "zz" are not.

Your task is to find any diverse substring of string ss or report that there is none. Note that it is not required to maximize or minimize the length of the resulting substring.

Input

The first line contains a single integer nn (1≤n≤10001≤n≤1000) — the length of string ss.

The second line is the string ss, consisting of exactly nn lowercase Latin letters.

Output

Print "NO" if there is no diverse substring in the string ss.

Otherwise the first line should contain "YES". The second line should contain any diverse substring of string ss.

Examples

Input

10
codeforces

Output

YES
code

Input

5
aaaaa

Output

NO

Note

The first example has lots of correct answers.

Please, restrain yourself from asking if some specific answer is correct for some specific test or not, these questions always lead to "No comments" answer.

#include<bits/stdc++.h>
using namespace std;
char s[1100];
int main(){
	int n;int flag=0;int i;
	cin>>n;
	
	cin>>s;
	

	for( i=1;i<n;i++){
		if(s[i]!=s[i-1]){
			cout<<"YES"<<endl;
			cout<<s[i-1];
			cout<<s[i]<<endl;
			return 0;
		}

	}

		cout<<"NO"<<endl;
		return 0;
	
	
	
}

有的时候就是传说中的玄学，好吧，只是很简单的题错了也不知道哪儿错了。

还是要尽量简化。明明长得差不多，由于本人太渣，出现了些留有以后解决的问题。