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(){
  int a=0,b=0,c=0;
  string S;
  cin>>S;
  int n = S.length();
  for(int i=0;i<n;i++){
    int val = S[i] - 'a';
    if(val==0) a++;
    if(val==1) b++;
    if(val==2) c++;
  }
  int ab = abs(a-b);
  int bc = abs(b-c);
  int ca = abs(c-a);
  if(ab<2 && bc<2 && ca<2){
    cout<<"YES"<<endl;
  }
  else{
    cout<<"NO"<<endl;
  }
  return 0;
}
