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>
using namespace std;
int main()
{
	string s;
	int num[3]={0},i;
	cin >> s;
	for(i=0;i<s.size();i++)
		num[s[i]-'a']++;
	i=min(num[0],min(num[1],num[2]));
	if(num[0]-i>1 || num[1]-i>1 || num[2]-i>1) puts("NO");
	else puts("YES");
}