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 <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
using namespace std;

typedef long long ll;

string s;
int cnt[3], t[3];

int main() {
	cin >> s;
	for (int i = 0; i < (int)s.length(); ++i) ++cnt[s[i] - 'a'];
	int mi = cnt[0], ma = cnt[0];
	for (int i = 0; i < 3; ++i) {
		mi = min(mi, cnt[i]);
		ma = max(ma, cnt[i]);
	}
	if (ma - mi <= 1) cout << "YES" << endl;
	else cout << "NO" << endl;
	return 0;
}