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<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int chk[5];
char s[100005];
int main(){
    int n,i;
    scanf("%s",s);
    n=strlen(s);
    for(i=0;i<n;i++)    chk[s[i]-'a']++;
    sort(chk,chk+3);
    if(chk[2]-1>chk[0]){
        printf("NO\n");
    }else{
        printf("YES\n");
    }
    return 0;
}
