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;
string s;
int main(void) {
    std::ios::sync_with_stdio(0);
    cin.tie(), cout.tie(0);
    int num[3];
    while(cin >> s) {
        num[0] = num[1] = num[2] = 0;
        for(int i = 0; s[i]; ++i)
            ++num[s[i] - 'a'];
        sort(num, num + 3);
        int a = num[2] - num[0];
        cout << (a <= 1 ? "YES" : "NO") << endl;
    }
}
