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=S.size();
  int a=0,b=0,c=0;
  for(int i=0;i<s;i++){
    if(S[i]=='a')a++;
    if(S[i]=='b')b++;
    if(S[i]=='c')c++;
  }
  string ans="NO";
  if(s%3==0){
    if(a==b && b==c){ans="YES";}
  }
  else if(s%3==1){
    int m=min({a,b,c});
    if(a+b+c-3*m==1){ans="YES";}
  }
  else{
    int M=max({a,b,c});
    if(3*M-a-b-c==1){ans="YES";}
  }
  cout << ans << endl;
}