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
#include<cstdio>
#include<cstring>
#include<cstdlib>

char s[100005];

int main()
{
    scanf("%s", s);
    int lng = strlen(s);

    int a = 0, b = 0, c = 0;
    for (int i = 0; i < lng; i++) {
        if (s[i] == 'a') a++;
        if (s[i] == 'b') b++;
        if (s[i] == 'c') c++;
    }

    bool jdg = true;
    if (abs(a - b) >= 2) jdg = false;
    if (abs(b - c) >= 2) jdg = false;
    if (abs(c - a) >= 2) jdg = false;

    if (jdg) printf("YES\n");
    else printf("NO\n");
}