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
# coding: utf-8

from collections import Counter

s = input().strip()
l = len(s)
c = Counter(s)
cs = [0, 0]
for i, (_, cnt) in enumerate(c.most_common(2)):
    cs[i] = cnt
if (cs[0] - 1 <= l - cs[0]) and (l - cs[0] - cs[1] >=  cs[0] - 1):
    print("YES")
else:
    print("NO")
