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;
#define maxn 100010
char s[maxn];
int main(){
	cin>>s;
	int n=strlen(s);
	int a[4];
	a[1]=a[2]=a[3]=0;
	for (int i=0;i<n;i++)
	{
		if (s[i]=='a')a[1]++;
		if (s[i]=='b')a[2]++;
		if (s[i]=='c')a[3]++;
	}
	sort(a+1,a+1+3);
	if (a[3]-a[1]<=1 && a[2]-a[1]<=1) puts("YES");
	else puts("NO");
}