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;
using ll = int64_t;
int main(){
	string s; cin >> s;
	int count[3] = {};
	for(int i = 0; i < s.size(); ++i) ++count[s[i] - 'a'];
	int m = 1e5+1;
	for(int i = 0; i < 3; ++i) m = min(m, count[i]);
	for(int i = 0; i < 3; ++i) count[i] -= m;
	int po = 0;
	for(int i = 0; i < 3; ++i){
		if(count[i] == 1) ++po;
		else if(count[i] > 1) po += 3;
	}
	cout << (po >= 3 ? "NO\n" : "YES\n");
	return 0;
}