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;

typedef long long ll;

const ll MOD = 1000000007;

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    string s; cin >> s;
    int cnta = 0, cntb = 0, cntc = 0;
    for(int i=0;i<s.size();i++){
        if(s[i] == 'a') cnta++;
        if(s[i] == 'b') cntb++;
        if(s[i] == 'c') cntc++;
    }
    int cntmax = max(cnta, max(cntb, cntc));
    if(cntmax - cnta <= 1 && cntmax - cntb <= 1 && cntmax - cntc <= 1){
        cout << "YES" << endl;
    }else{
        cout << "NO" << endl;
    }
}