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 llong = long long;
using ldbl = long double;
using P = pair<llong, llong>;

#define BE(x) x.begin(), x.end()

const llong inf = llong(1e18)+7;
const llong mod = 1e9+7;

int main(){
	string s;
	vector<int> alp(3,0);

	cin >> s;
	for(auto x: s)
		alp[x-'a']++;
	sort(BE(alp));
	int mini = alp[0];
	alp[0] -= mini;
	alp[1] -= mini;
	alp[2] -= mini;

	if(alp[2] >= 2)
		cout << "NO" << endl;
	else
		cout << "YES" << endl;

	return 0;
}