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<string>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>

using namespace std;

string s;

int main(){
	int a = 0, b = 0, c = 0;
	cin >> s;
	for(int i = 0; i < s.size(); i++){
		if(s[i] == 'a')
			a++;
		if(s[i] == 'b')
			b++;
		if(s[i] == 'c')
			c++;
	}
	if(abs(a-b) > 1 || abs(a-c) > 1 || abs(b-c) > 1)
		cout << "NO" << endl;
	else
		cout << "YES" << endl;
	
	return 0;
}