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 <cstdio>
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;

typedef long long LL;

const string temp = "AKIHABARA";

int vis[26];

int main() {
   // freopen("in.txt", "r", stdin);
    string s;
    cin >> s;
    int n = s.length(), m = 0;
    for (int i = 0; i < n; i++) {
        vis[s[i] - 'a'] ++;
        m = max(m, vis[s[i] - 'a']);
    }
    puts((m - 1) * 3 + 1 <= n ? "YES" : "NO");
    return 0;
}
