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>
#include <string>
#include <algorithm>

using namespace std;
int main(){
	string s;
	cin >> s;
	int i,n,a = 0,b = 0, c = 0;
	n = s.size();
	for(i=0;i<n;i++){
		if(s[i]=='a'){
			a++;
		}
		if(s[i]=='b'){
			b++;
		}
		if(s[i]=='c'){
			c++;
		}
	}
	int u = max({a,b,c}),v = min({a,b,c});
	if(u-v<=1){
		cout << "YES" << endl;
		return 0;
	}
	cout  << "NO" << endl;
}