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<algorithm>
#include<map>
#include<cstring>
using namespace std;
int a[110000];
const int maxn=1e5;
string code="AKIHABARA",st;
int cnt[5]={0};
int main(int argc, const char * argv[])
{
    cin>>st;
    int len=st.length();
    for(int i=0;i<len;i++)cnt[st[i]-'a']++;
    sort(cnt+0,cnt+3);
    if(cnt[2]-cnt[0]>1)cout<<"NO"<<endl;
    else cout<<"YES"<<endl;
}
