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<cstdio>

using namespace std;

const int maxn=1e5+50;
char s[maxn];
int cnt[maxn];

int main(){
    scanf("%s",s);
    int len=strlen(s);
    memset(cnt,0,sizeof(cnt));
    for (int i=0;i<len;i++){
        cnt[s[i]]++;
    }
    for (char i='a';i<='c';i++){
        for (char j='a';j<='c';j++){
            if (cnt[i]-cnt[j]>1){
                printf("NO\n");
                return 0;
            }
        }
    }
    printf("YES\n");
    return 0;
}