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<iostream>
using namespace std;
int main(void){
	int a,b,c;
	string S;
	cin>>S;
	a=b=c=0;
	for (int i=0;i<S.size();++i)
		if (S[i]=='a') ++a;
		else if (S[i]=='b') ++b;
		else ++c;
	if ((a-1)*2>(b+c)||(b-1)*2>(a+c)||(c-1)*2>(a+b)) cout<<"NO"<<endl;
	else cout<<"YES"<<endl;
	return 0;
}