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 <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
#define maxn 100005
char s[maxn];
int a[3];
int main()
{
    scanf("%s", s);
    for(int i = 0; i < strlen(s); i++) {
        if(s[i] == 'a') a[0]++;
        else if(s[i] == 'b') a[1]++;
        else a[2]++;
    }
    sort(a, a+3);
    int ok=0;
    if(a[2]-a[0] == 1 || a[2]-a[0] == 0) ok = 1;
    if(ok) printf("YES\n");
    else printf("NO\n");
    return 0;
}
