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 <bits/stdc++.h>

using namespace std;

int main () {
	string s;
	cin >> s;
	int a=0,b=0,c=0;
	for (int i=0;i<s.size();i++) {
		if (s[i]=='a') a++;
		else if (s[i]=='b') b++;
		else c++;
	}
	while (a>0&&b>0&&c>0) {
		a--;
		b--;
		c--;
	}
	if ((a==0&&b==0&&c==0)||(a==1&&b==0&&c==0)||(a==1&&b==1&&c==0)||(a==0&&b==1&&c==0)||(a==0&&b==1&&c==1)||(a==0&&b==0&&c==1)||(a==1&&b==0&&c==1)) cout << "YES" << endl; 
	else cout << "NO" << endl;
	return 0;
}