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
# https://atcoder.jp/contests/cf17-final-open/tasks/cf17_final_b
from collections import Counter

S = input()
counter = Counter(S)
most_common = list(counter.items())
while len(most_common) < 3:
    most_common.append(('x', 0))
    
most_common.sort(key=lambda x:x[1] ,reverse=False)
# print(most_common)
ret = 'YES' if most_common[1][1] <= most_common[0][1]+1 and most_common[2][1] <= most_common[0][1]+1 else 'NO'
print(ret)