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;
const int maxn=100005;

char s[maxn];

int main()
{
    while(~scanf("%s", &s)){
        int ca=0, cb=0, cc=0;
        int len=strlen(s);
        for(int i=0;i<len;i++){
            if(s[i]=='a')ca++;
            if(s[i]=='b')cb++;
            if(s[i]=='c')cc++;
        }
        int mi=min(ca, cb);
        mi=min(mi, cc);
        ca-=mi;
        cb-=mi;
        cc-=mi;
        if(ca<2&&cb<2&&cc<2){
            printf("YES\n");
        }
        else printf("NO\n");
    }
    return 0;
}
