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<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<random>
using namespace std;
 
int main() {
 
  string s; cin >> s;
 
  int a[3] = {0,0,0};
 
  for(int i=0; i<s.size(); i++){
    a[ s[i]-'a' ]++;
  }
  if( max({a[0],a[1],a[2]}) - min({a[0],a[1],a[2]}) <= 1 ) cout << "YES" << endl;
  else cout << "NO" << endl;
 
  return 0;
}
 
// EOF