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;
typedef long long LL;
typedef pair<LL,LL> PII;


int main() {
	string s;
	cin >> s;
	int cnt[3];
	cnt[0] = cnt[1] = cnt[2] = 0;
	for(int i=0; i<s.size(); i++)
		cnt[s[i] - 'a'] ++;
	int maxim = max(cnt[0], max(cnt[1], cnt[2]));
	int minim = min(cnt[0], min(cnt[1], cnt[2]));
	//cout << minim << " " << maxim << endl;
	if(maxim - minim <= 1)
		cout << "YES" << endl;
	else cout << "NO" << endl;
	
	return 0;
}