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

line = sys.stdin.readline().strip()
# print(line)

def check(line):
    ns = line.count("a"), line.count("b"), line.count("c")
    ns = sorted(ns)
    m = min(ns)
    ns = ns[0] - m, ns[1] - m, ns[2] - m
    # print(ns, m)
    return ns[2] < 2

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