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 <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;

int main(){
  string s;
  cin>>s;
  int n=s.size();

  int alp[3]={};
  for(int i=0;i<n;i++){
    alp[s[i]-'a']++;
  }

  int three=0,four=0;
  for(int i=0;i<3;i++){
    if(alp[i]==n/3) three++;
    else if(alp[i]==n/3+1) four++;
  }

  if(three==3-n%3&&four==n%3) cout<<"YES"<<endl;
  else cout<<"NO"<<endl;

  return 0;
}
