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 = input()

import collections as col
cc = col.Counter(S)

mi = 10000000000000000
ma = -1000
for k,v in cc.items():
  mi = min(mi,v)
  ma = max(ma,v)
if ( len(cc.keys())<3 ):
  mi = 0
 
if (ma-mi<=1):
  print ("YES")
else:
  print ("NO")
  