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
# B問題
S = input()
var_str = {'a':0,'b':0,'c':0}
var_list = []

for i in S:
	var_str[i] += 1

for i,j in var_str.items():
	var_list.append((i,j))

var_list.sort(key = lambda x:x[1])

first = var_list[-1][1]
second = var_list[1][1]
third = var_list[0][1]

first -= third 
second -= third

if first <= 1 and second <= 1:
	print("YES")
else:
	print("NO")
