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;
string S;
int main(){
    cin>>S;
    int a{(int)count(S.begin(),S.end(),'a')},b{(int)count(S.begin(),S.end(),'b')},c{(int)count(S.begin(),S.end(),'c')};
    int min_n{min(a,min(b,c))},max_n{max(a,max(b,c))};
    if(max_n>min_n+1)cout<<"NO"<<endl;
    else cout<<"YES"<<endl;
}
