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

using namespace std;

int main(){
	ios_base::sync_with_stdio(false);
	string s;
	cin >> s;
	const int n = s.size();
	vector<int> h(3);
	for(int i = 0; i < n; ++i){ ++h[s[i] - 'a']; }
	const int t = n / 3;
	bool answer = true;
	for(int i = 0; i < 3; ++i){
		if(h[i] != t && h[i] != t + 1){ answer = false; }
	}
	cout << (answer ? "YES" : "NO") << endl;
	return 0;
}

