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;
#define dump(x) cout << (x) << '\n';
typedef int64_t Int;
Int mod = 1e9+7;
Int INF = 1e9+18;

int main() {
    ios::sync_with_stdio(false);   
    string s;
    cin >> s;
    Int n = (Int)s.size();
    Int a[3] = {};
    for (Int i = 0; i < n; i++) a[s[i] - 'a']++;
    sort(a, a + 3);
    if ((a[0] == a[1] && a[1] == a[2]) ||
        (a[0] + 1 == a[2] && a[1] == a[2]) ||
        (a[0] + 1 == a[2] && a[0] == a[1])) {
            dump("YES");
    }
    else {
        dump("NO");
    }
    return 0;
}