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
def b_palindrome_phobia(S):
    a_cnt = S.count('a')
    b_cnt = S.count('b')
    c_cnt = S.count('c')
    count = [a_cnt, b_cnt, c_cnt]
    ans = 'YES' if max(count) - min(count) <= 1 else 'NO'
    return ans

S = input().strip()
print(b_palindrome_phobia(S))