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 n = S.size();
	int num[3] = {0};
	for( int i = 0; i < n; i++ ) {
		if( S[i] == 'a' ) num[0]++;
		else if( S[i] == 'b' ) num[1]++;
		else num[2]++;
	}
	sort( num, num + 3 );
	string ans = "YES";
	if( num[2] - num[1] > 1 || num[1] - num[0] > 1 || num[2] - num[0] > 1 ) ans = "NO";

	cout << ans << endl;
}
