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 <string>
#include <algorithm>

using namespace std;

int main(){
    string s; cin >> s;
    int N = s.length();

    int cnt[3] = {0,0,0};
    char abc[3] = {'a', 'b', 'c'};

    for(int i=0;i<N;i++){
        for(int k=0;k<3;k++){
            if(s[i] == abc[k]){
                cnt[k]++;
            }
        }
    }

    sort(cnt, cnt+3);
    if(cnt[2] - cnt[0] >= 2){
        cout << "NO" << endl;
    }else{
        cout << "YES" << endl;
    }

    return 0;

}