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<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
string s;
int a[3];
int main(void){
	register int i;
	cin>>s;
	for(i=0;i<s.length();++i)
		++a[s[i]-'a'];
	sort(a,a+3);
	if(a[2]==a[1]&&a[1]==a[0]||a[2]==a[1]&&a[1]-1==a[0]||a[2]-1==a[1]&&a[1]==a[0])
		puts("YES");
	else 
		puts("NO");
	return 0;
}