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 <bits/stdc++.h>
using namespace std;
int s[3];

int main() {
    char ch=getchar();
    while (ch>='a' && ch<='c') {
        s[ch-'a']++;
        ch=getchar();
    }
    sort(s,s+3);
    s[1]-=s[0],s[2]-=s[0],s[0]=0;
    if (s[1]>1 || s[2]>1) puts("NO");
    else puts("YES");
    return 0;
}