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;
    cin >> S;
    int num[3] = { 0 };
    for (char c : S) {
        num[c - 'a']++;
    }
    int max_num = INT_MIN, min_num = INT_MAX;
    for (int i = 0; i < 3; i++) {
        max_num = max(max_num, num[i]);
        min_num = min(min_num, num[i]);
    }
    if (max_num - min_num >= 2) {
        cout << "NO" << endl;
    } else {
        cout << "YES" << endl;
    }
}
