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()
nums = [S.count(x) for x in 'abc']
nums.sort()
nums[-1] -= nums[0]
nums[1] -= nums[0]

def check():
    if nums[1] == 0 and nums[-1] > 1:
        return False
    if nums[1] > 1 or nums[-1] > 1: 
        return False
    return True

print("YES" if check() else "NO")
