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 = list(input())
N = len(S)
A = S.count("a")
B = S.count("b")
C = S.count("c")

if  N % 3 == 0:
	if A == B and B == C:
		print("YES")
	else:
		print("NO")
else:
	n = int(N // 3)
	if n <= A and A <= n + 1 and n <= B and B <= n + 1 and n <= C and C <= n + 1:
		print("YES")
	else:
		print("NO")