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

using namespace std;

int CountA, CountB, CountC;
int threshold;

int main() {

	string S;
	cin >> S;
	for (int i = 0; i < S.size(); i++) {
		if (S[i] == 'a') CountA++;
		if (S[i] == 'b') CountB++;
		if (S[i] == 'c') CountC++;
	}

	if (S.size() % 3 == 0) threshold = S.size() / 3;
	else threshold = S.size() / 3 + 1;

	if (CountA <= threshold && CountB <= threshold && CountC <= threshold)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
	return 0;
}