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()
n = {'a': 0, 'b': 0, 'c': 0}
for c in s:
    n[c] += 1

import sys
if len(s) == 1:
    print('YES')
    sys.exit(0)

min = int(len(s)/3)
val = list(n.values())
val.sort()
if len(s)%3 == 0:
    if val == [min, min, min]:
        print('YES')
    else:
        print('NO')
elif len(s)%3 == 1:
    if val == [min, min, min+1]:
        print('YES')
    else:
        print('NO')
elif len(s)%3 == 2:
    if val == [min, min+1, min+1]:
        print('YES')
    else:
        print('NO')

