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;
	vector<int> v(3);
	v[0] = v[1] = v[2] = 0;
	for(int i = 0; i < S.length(); i++) {
		v[S[i] - int('a')]++;
	}
	bool ans = (*max_element(v.begin(), v.end()) - *min_element(v.begin(), v.end())) <= 1;
	cout << (ans ? "YES" : "NO") << endl;
	return 0;
}