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<cstring>
#include<algorithm>
using namespace std;
int main(){
    int a,b,c,mina,maxa,n;
    char s[100010];
    a=b=c=0;
    scanf("%s",s);
    n=strlen(s);
    for(int i=0;i<n;i++){
        if(s[i]=='a'){
            a++;
        }
        else if(s[i]=='b'){
            b++;
        }
        else{
            c++;
        }
    }
    mina=maxa=a;
    maxa=max(maxa,b);
    maxa=max(maxa,c);
    mina=min(mina,b);
    mina=min(mina,c);
    if(maxa-mina>1){
        printf("NO\n");
    }
    else{
        printf("YES\n");
    }
}