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;

const int N = 1e5 + 50;
char s[N];
int cnt[5];

int main() {
    scanf("%s",s);
    int n = strlen(s);

    if(n==3) {
        set<char> st;
        for(int i=0; i<n; i++) st.insert(s[i]);
        if(st.size()==2)
            puts("NO");
        else puts("YES");
        return 0;
    }
    for(int i=0; i<n; i++) {
        cnt[s[i]-'a']++;
    }
    sort(cnt,cnt+3);
    if(cnt[2]-cnt[0] > 1) {
        puts("NO");
    } else {
        puts("YES");
    }


}


