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 = long long;

int main() {
	string s;
	cin >> s;

	vector<int> cnt(3, 0);
	for (int i = 0; i < s.size(); ++i) {
		int idx = (int)(s[i] - 'a');
		++cnt[idx];
	}
	sort(cnt.rbegin(), cnt.rend());

	bool can = true;
	for (int i = 0; i < 3; ++i) {
		int len = s.size() / 3;
		if (s.size() % 3 > i) { ++len; }
		if (cnt[i] != len) { can = false; }
	}

	if (can) { cout << "YES" << endl; }
	else { cout << "NO" << endl; }

	return 0;
}
