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;

int main() {
    string s;
    int cnt[3]{}, k;
    cin >> s;
    for(auto c : s){
        ++cnt[c-'a'];
    }
    // abcabc...のように並べるので
    k = *min_element(cnt,cnt+3);
    cout << (cnt[0]-k < 2 && cnt[1]-k < 2 && cnt[2]-k < 2 ? "YES" : "NO") << endl;
    return 0;
}
