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
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
    string s;
    std::cin >> s;
    ll a,b,c;
    a = b= c = 0;
    for (int i = 0; i < s.length(); i++) {
        if(s[i] == 'a'){
            a++;
        }else if(s[i]=='b'){
            b++;
        }else{
            c++;
        }
    }
    ll m = min({a,b,c});
    // a,b,c,a,b,c,a,b,c,みたいになりそう
    if(a-m>= 2 || b-m>= 2 || c-m >= 2){
        std::cout << "NO" << std::endl;
    }else{
        std::cout << "YES" << std::endl;
    }
}
