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 <iostream>
#include <algorithm>
using namespace std;
#define FAIL { cout << "NO\n"; return 0; }

int main() {
    int a[3] = {}, i, N = 0;
    char c;

    while (cin >> c) {
        if (c == '=') break;
        a[(int)(c-'a')]++;
        N++;
    }
    sort(a, a+3, greater<int>()); // descending

    for (i = 0; i < 3; i++) {
        if (1+i+3*(a[i]-1) > N) FAIL;
    }
    cout << "YES\n";
}