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()

c = Counter(s)

if len(c.values()) == 1:
    if len(s) == 1:
        ans = "YES"
    else:
        ans = "NO"

elif len(c.values()) == 2:
    if len(s) == 2:
        ans = "YES"
    else:
        ans = "NO"

else:
    cnt = sorted(c.values())
    bl1 = cnt[0] == cnt[1] == cnt[2]
    bl2 = cnt[0] == cnt[1] == cnt[2] - 1
    bl3 = cnt[0] == cnt[1] - 1 == cnt[2] - 1
    if bl1 or bl2 or bl3:
        ans = "YES"
    else:
        ans = "NO"

print(ans)
