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 ;
    int a , b , c ;
    a = b = c = 0 ;
    cin >> s ;
    int len = s.length() ;
    for( int i = 0 ; i < len ; i++ ){
        if ( s[i] == 'a' ) a++ ;
        if ( s[i] == 'b' ) b++ ;
        if ( s[i] == 'c' ) c++ ;
    }
    int maxx = max( max( a , b ) , c ) ;
    int minx = min( min( a , b ) , c ) ;
    if ( maxx - minx > 1 ) cout << "NO" << endl ;
    else cout << "YES" << endl ;
    return 0 ;
}