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 defaultdict
cnt=defaultdict(int)
S=input()
for s in S:
    cnt[s]+=1
X=[cnt["a"],cnt["b"],cnt["c"]]
X.sort()
ans=False
if X[0]==X[1]==X[2]:
    ans=True
elif X[0]==X[1]:
    if X[0]+1==X[2]:
        ans=True
elif X[1]==X[2]:
    if X[2]-1==X[0]:
        ans=True
if ans:
    print('YES')
else:
    print('NO')