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 main(){
  string S;
  cin>>S;
  int s[3]={};
  for(int i=0;i<S.size();i++){
    s[S[i]-'a']++;
  }
  int mx=0;
  mx=min(s[0],s[1]);
  mx=min(mx,s[2]);

  for(int i=0;i<3;i++){
    s[i]=s[i]-mx;
  }
  if(s[0]>=2||s[1]>=2||s[2]>=2){
    cout<<"NO"<<endl;
  }else{
    cout<<"YES"<<endl;
  }
  return 0;
}
