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()
count = []

count.append(S.count('a'))
count.append(S.count('b'))
count.append(S.count('c'))

max = max(count)
min = min(count)

if count.count(max) == 2:
    if min == max-1:
        print ("YES")
    else :
        print("NO")
elif count.count(min) == 2:
    if min == max-1:
        print ("YES")
    else :
        print("NO")
elif max == min:
    print ("YES")
else:
    print("NO")