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 a=0,b=0,c=0;
  for(int i=0;i<S.length();i++){
    if(S[i]=='a')a+=1;
    else if(S[i]=='b')b+=1;
    else if(S[i]=='c')c+=1;
  }
  if(abs(a-b)<=1 && abs(a-c)<=1 && abs(b-c)<=1)cout <<"YES";
  else cout <<"NO";
}

