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
import collections
import math

S = list(input())

count = dict(collections.Counter(S))
m = list(count.values())

if len(m) == 1 and len(S) == 1: # 文字1種類のとき
    print("YES")
elif len(m) == 1 and len(S) > 1:
    print("NO")
elif len(m) == 2 and len(S) == 2:
    print("YES")
elif len(m) == 2 and len(S) > 2:
    print("NO")
elif (max(m) - min(m)) <= 1:
    print("YES")
else:
    print("NO")
