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 <algorithm>
#include <cstring>
using namespace std;
char x[100005];
int a[3];
int main(void){
    cin>>x;
    int xl=strlen(x);
    for(int i=0;i<xl;i++)a[int(x[i]-'a')]++;
    sort(a,a+3);
    if((a[0]==a[1]&&a[2]==a[1]+1)||(a[0]+1==a[1]&&a[1]==a[2])||(a[0]==a[1]&&a[1]==a[2]))cout<<"YES\n";
    else cout<<"NO\n";
}
