Not simply beatiful strings （思维）

Let's call a string adorable if its letters can be realigned in such a way that they form two consequent groups of equal symbols (note that different groups must contain different symbols). For example, ababa is adorable (you can transform it to aaabb, where the first three letters form a group of a-s and others — a group of b-s), but cccc is not since in each possible consequent partition letters in these two groups coincide.

You're given a string s. Check whether it can be split into two non-empty subsequences such that the strings formed by these subsequences are adorable. Here a subsequence is an arbitrary set of indexes of the string.

Input

The only line contains s (1 ≤ |s| ≤ 10⁵) consisting of lowercase latin letters.

Output

Print «Yes» if the string can be split according to the criteria above or «No» otherwise.

Each letter can be printed in arbitrary case.

Examples

Input

ababa

Output

Yes

Input

zzcxx

Output

Yes

Input

yeee

Output

No

Note

In sample case two zzcxx can be split into subsequences zc and zxx each of which is adorable.

There's no suitable partition in sample case three.

题意：一个 adorable串是可以分成两个不含有相同字符的子串，而每个子串只有一种字母；现在给一个字符串，问能否将它分成两个 adorable串代码：

#include<cstdio>
#include<cstring>
using namespace std;
const int N = 100005;
char str[N];
int vis[26];
int main(){
	scanf("%s",str);
	int len=strlen(str);
	for(int i=0;i<len;i++)
	   vis[str[i]-'a']++;
	int ans=0;
	for(int i=0;i<26;i++)
	   if(vis[i]) ans++;
	if(ans==1||ans>4) printf("No\n");
	else{
		if(ans==2){
			int flag=1;
			for(int i=0;i<26;i++)
			   if(vis[i]==1){
			   	 flag=0;
			   	 break;
			   }
			printf("%s\n",flag? "Yes" : "No");
		}
		else if(ans==3){
			int flag=0;
			for(int i=0;i<26;i++){
				if(vis[i]>1){
				  flag=1;
				  break;	
				}
			}
			printf("%s\n",flag? "Yes" : "No");
		}
		else printf("Yes\n");
	}
	return 0;
}