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;
int sum[3];
int main()
{

    char str[100000+10];
    cin>>str;
    for(int i=0;i<strlen(str);++i)
    {
        if(str[i]=='a') sum[0]++;
        if(str[i]=='b') sum[1]++;
        if(str[i]=='c') sum[2]++;
    }
    sort(sum,sum+3);
    //cout<<sum[2]<<sum[1]<<sum[0]<<endl;
    if(2*sum[2]-sum[1]-sum[0]>2) cout<<"NO"<<endl;
    else cout<<"YES\n";
    return 0;
}
