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;
  map<char, int> mp;
  for(int i=0;i<s.size();i++){
    mp[s[i]]++;
  }
  if(s.size()==1){
    cout << "YES\n";
    return 0;
  }
  if(abs(mp['a']-mp['b'])<=1 and abs(mp['a']-mp['c'])<=1 and abs(mp['c']-mp['b'])<=1 ){
    cout << "YES\n";
  }else{
    cout << "NO\n";
  }
  return 0;
}
