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

const int N = 100000;

char buf[N + 1];

int main()
{
#ifdef LOCAL_JUDGE
    freopen("B.in", "r", stdin);
#endif
    while (scanf("%s", buf) == 1) {
        int cnt[] = {0, 0, 0};
        for (int i = 0; buf[i]; ++ i) {
            cnt[buf[i] - 'a'] ++;
        }
        std::sort(cnt, cnt + 3);
        bool ok = false;
        ok |= cnt[0] == cnt[1] && cnt[0] == cnt[2];
        ok |= cnt[0] == cnt[1] && cnt[0] + 1 == cnt[2];
        ok |= cnt[0] + 1 == cnt[1] && cnt[0] + 1 == cnt[2];
        puts(ok ? "YES" : "NO");
    }
}
