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
s = input()
N = len(s)
a, b, c = 0, 0, 0
for i in range(N):
    if s[i] == "a":
        a += 1
    elif s[i] == "b":
        b += 1
    else:
        c += 1

r = [a, b, c]
r = sorted(r, reverse=True)
if len(s) % 3 == 0 and len(s) // 3 >= r[0]:
    print("YES")
elif len(s) % 3 == 1 and len(s) // 3 + 1 >= r[0] and len(s) // 3 >= r[1]:
    print("YES")
elif len(s) % 3 == 2 and len(s) // 3 + 1 >= r[0] and len(s) // 3 + 1 >= r[1] and len(s) // 3 >= r[2]:
    print("YES")
else:
    print("NO")