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 <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
string s; int ca, cb, cc;
int main() {
	cin >> s;
	for (int i = 0; i < s.size(); i++) {
		if (s[i] == 'a') ca++;
		if (s[i] == 'b') cb++;
		if (s[i] == 'c') cc++;
	}
	int quot = s.size() / 3;
	if ((ca == quot || ca == quot + 1) && (cb == quot || cb == quot + 1) && (cc == quot || cc == quot + 1)) cout << "YES" << endl;
	else cout << "NO" << endl;
	return 0;
}