Snuke has a string S consisting of three kinds of letters: `a`, `b` and `c`.

He has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of length 2 or more as a substring. Determine whether this is possible.

Constraints

* 1 \leq |S| \leq 10^5
* S consists of `a`, `b` and `c`.

Input

Input is given from Standard Input in the following format:


S


Output

If the objective is achievable, print `YES`; if it is unachievable, print `NO`.

Examples

Input

abac


Output

YES


Input

aba


Output

NO


Input

babacccabab


Output

YES
#include<stdio.h>
#include<string.h>

char s[100005];
int main(){
	int len,i;
	int a,b,c,t;
	while(scanf("%s",s)!=EOF){
		a=0;b=0;c=0;
		len=strlen(s);
		for(i=0;i<len;i++){
			if(s[i]=='a')
				a++;
			else if(s[i]=='b')
				b++;
			else
				c++;
		}
		if(a<b){
			t=a;a=b;b=t;}
		if(a<c){
			t=a;a=c;c=t;}
		if(b<c){
			t=b;b=c;c=t;}
		
		if(a-c>=2)
			printf("NO\n");
		else
			printf("YES\n");
	}
	return 0;
}