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<cstring>
#include<algorithm>
using namespace std;
char ca[100007];
int main(){
	int n[3]={0};
	int i,j,k;
	cin>>ca;
	for(i=0;i<strlen(ca);i++){
		j=(int)ca[i]-(int)'a';
		n[j]++;
	}
	if(n[0]>n[1])swap(n[0],n[1]);
	if(n[1]>n[2])swap(n[1],n[2]);
	if(n[0]>n[1])swap(n[0],n[1]);
	if(n[2]-n[0]<=1)cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
	return 0;
}
