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
from collections import Counter
S = input()
L = len(S)
ans = [''] * L
chara = []
chrstat = Counter(S).most_common
for (k, v) in reversed(Counter(S).most_common()):
    for _ in range(v):
        chara.append(k)
for i in range(0, L, 3):
    ans[i] = chara.pop()
for i in range(1, L, 3):
    ans[i] = chara.pop()
for i in range(2, L, 3):
    ans[i] = chara.pop()
ans = ''.join(ans)
print("YES" if all(ans[i] != ans[i + 1] for i in range(L - 1)) and \
      all(ans[i] != ans[i + 2] for i in range(L - 2)) else "NO")
