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;
#define ll long long int
int main(){
    int a=0,b=0,c=0;
    char ch;
    while(cin>>ch){
        if(ch=='a')a++;
        if(ch=='b')b++;
        if(ch=='c')c++;
    }
    cout<<((fabs(a-b)<=1&&fabs(b-c)<=1&&fabs(c-a)<=1)?"YES":"NO")<<endl;
}