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
def main():
    s = input()

    cnt, k = [0 for i in range(3)], 0
    for i in range(len(s)):
        idx = ord(s[i])-ord('a')
        cnt[idx] += 1
        if cnt[idx] == 1:
            k += 1

    if k <= 2 and k < len(s):
        print("NO")
        return

    over = 0
    for i in range(3):
        if (len(s)+2) // 3 < cnt[i]:
            print("NO")
            break
        elif len(s) // 3 < cnt[i]:
            over += 1
    else:
        if over <= len(s) % 3:
            print("YES")
        else:
            print("NO")


if __name__ == '__main__':
    main()
