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>
#include <algorithm>

using namespace std;

int main()
{
  string S;
  cin >> S;
  int a = 0, b = 0, c = 0;
  for (auto& e : S) {
    if (e == 'a') a++;
    if (e == 'b') b++;
    if (e == 'c') c++;
  }
  int mi = min({a, b, c});
  a -= mi;
  b -= mi;
  c -= mi;
  if (a >= 2 || b >= 2 || c >= 2) cout << "NO" << endl;
  else cout << "YES" << endl;

  return 0;
}