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"
#define in std::cin
#define out std::cout
#define rep(i,N) for(int i=0;i<N;++i)
typedef long long int LL;

std::string S;
int couA, couB, couC;

int main()
{
	in >> S;

	for (auto c : S)
	{
		if (c == 'a') { ++couA; }
		if (c == 'b') { ++couB; }
		if (c == 'c') { ++couC; }
	}
	if (abs(couA - couB) <= 1 && abs(couB - couC) <= 1 && abs(couA - couC) <= 1)
	{
		out << "YES" << std::endl;
	}
	else { out << "NO" << std::endl; }
	return 0;
}