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;
char s[100100];
int a[100];
int main(){
	scanf("%s",s);
	for(int i=0;s[i];i++)
		a[s[i]-'a']++;
	int c=min(a[0],min(a[1],a[2]));
	for(int i=0;i<3;++i)
		if((a[i]-=c)>=2)return puts("NO"),0;
	puts("YES");
}