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;

int main() {
	string s;
	cin >> s;
	int a[3] = {};
	for (auto it = begin(s); it != end(s); it++) {
		if (*it == 'a') {
			a[0]++;
		} else if (*it == 'b') {
			a[1]++;
		} else {
			a[2]++;
		}
	}
	sort(a, a + 3);
	cout << (a[2] - a[0] <= 1 ? "YES" : "NO") << endl;
	return 0;
}
