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 = raw_input()
a, b, c = 0, 0, 0
for s in S:
    if s == "a":
        a += 1
    if s == "b":
        b += 1
    if s == "c":
        c += 1
a, b, c = sorted([a, b, c], reverse = True)

if a - c <= 1:
    print "YES"
else:
    print "NO"
