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 <algorithm>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;

int main() {
  string S;
  while (cin >> S) {
    vector<int> cnt(3, 0);
    for (char c : S) ++cnt[c - 'a'];
    int m = min({cnt[0], cnt[1], cnt[2]});
    bool res = cnt[0] - m <= 1 && cnt[1] - m <= 1 && cnt[2] - m <= 1;
    cout << (res ? "YES" : "NO") << endl;
  }
  return 0;
}
