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<string>
using namespace std;

int main(){
  string str;
  cin >> str;
  int count[3] = {0,0,0};

  for(int i = 0 ; i < str.size() ; i++){
    count[str[i]-'a']++;
  }

  int mini = 1e9;
  for(int i = 0 ; i < 3 ; i++){
    mini = min(mini,count[i]);
  }

  for(int i = 0 ; i < 3 ; i++){
    count[i] = count[i] - mini;
  }

  bool flag = true;
  for(int i = 0 ; i < 3 ; i++){
    if(count[i] >= 2){
      flag = false;
    }
  }
  cout << (flag ? "YES" : "NO") << endl;
  return 0;
}
