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<algorithm>
#include<string>
int al[4];
int main() {
	std::string S;
	std::cin >> S;
	for (auto u : S) {
		al[u - 'a']++;
	}
	int M = std::max({ al[0],al[1],al[2] });
	int m = std::min({ al[0],al[1],al[2] });
	std::cout << (M - m < 2 ? "YES" : "NO") << std::endl;
	return 0;
}