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 sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

# abcabcab 型が必要

from collections import Counter
S = input().rstrip()
counter = Counter(S)
a = counter['a']
b = counter['b']
c = counter['c']

x = max(a,b,c) - min(a,b,c)

answer = 'YES' if x in [0,1] else 'NO'
print(answer)

