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;

long long anum, bnum, cnum;

int main(){
	string S;
	cin >> S;
	for(long long i = 0; i < S.size(); i++){
		if(S[i] == 'a'){
			anum++;
		}else if(S[i] == 'b'){
			bnum++;
		}else{
			cnum++;
		}
	}

	if(max(anum, max(bnum, cnum)) - min(anum, min(bnum, cnum)) >= 2){
		cout << "NO" << endl;
	}else{
		cout << "YES" << endl;
	}

}