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>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

string S;

int main(void) {
  cin >> S;

  ll a = 0, b = 0, c = 0;
  REP(i, 0, S.length()) {
    if(S[i] == 'a') a++;
    if(S[i] == 'b') b++;
    if(S[i] == 'c') c++;
  }

  if(abs(a - b) <= 1 && abs(b - c) <= 1 && abs(c - a) <= 1) cout << "YES" << endl;
  else cout << "NO" << endl;
}
