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;
string str;
void solve()
{
    vector < int > tag(3,0);
    int i,len=str.length();
    for (i=0;i<len;i++)
        tag[str[i]-'a']++;
    sort(tag.begin(),tag.end());
    if (tag[1]-tag[0]>1||tag[2]-tag[0]>1) cout<<"NO";
    else cout<<"YES";
    cout<<endl;
}
int main()
{
    while(cin>>str)
        solve();
}