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 <cstdio>
#include <algorithm>

static const int MAXN = 1e5 + 4;

static int a = 0, b = 0, c = 0;

int main()
{
    bool finished = false;
    while (!finished) switch (getchar()) {
        case 'a': ++a; break;
        case 'b': ++b; break;
        case 'c': ++c; break;
        default: finished = true; break;
    }

    int cyc = (a + b + c) / 3;
    if ((a -= cyc) < 0 || (b -= cyc) < 0 || (c -= cyc) < 0) {
        puts("NO"); return 0;
    }
    if (std::max(std::max(a, b), c) > 1) {
        puts("NO"); return 0;
    }

    puts("YES"); return 0;
}
