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;
  int c[3];
  memset(c, 0, sizeof(c));
  for (int i = 0; i < s.length(); ++i) {
    ++c[s[i] - 'a'];
  }
  sort(c, c + 3);
  cout << (c[2] <= c[0] + 1 ? "YES" : "NO") << endl;
}