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;
using ll=long long;
/*
2文字以上。aaもだめか
abc
abcab
総数くらい？
aaabbc
a
ab
abc
abcabcabc...のかたちしかないっぽい
*/
int main(){
  string S; cin>>S;
  ll sz=S.size(), A,B,C;
  A=B=C=0;
  for(int i=0; i<sz; i++){
    if(S[i]=='a')
      A++;
    else if(S[i]=='b')
      B++;
    else
      C++;
  }
  if(abs(A-B)>1 || abs(B-C)>1 || abs(A-C)>1)
    cout<<"NO"<<endl;
  else cout<<"YES"<<endl;
}