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;

#define INF 1e9

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    string s;
    cin>>s;

    vector<int> sum(3);

    for(int i=0;i<s.size();i++){
        if(s[i]=='a')sum[0]++;
        else if(s[i]=='b')sum[1]++;
        else sum[2]++;
    }

    sort(sum.begin(),sum.end());

    bool ans=((sum[2]-sum[0])<2);

    if(ans)cout<<"YES"<<endl;
    else cout<<"NO"<<endl;

}