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 rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;


string S;


void input() {
    cin >> S;
}


int main() {
    input();
    int n = S.size();
    vector<int> w(3, 0);
    for (char c : S) w[c - 'a']++;
    int x = 0;
    rep(i, 3) {
        for (int j = i + 1; j < 3; j++) {
            x = max(x, max(w[i] - w[j], w[j] - w[i]));
        }
    }
    if (x < 2) {
        cout << "YES" << endl;
    } else {
        cout << "NO" << endl;
    }
}
