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

int main(){
	string s;
	cin >> s;
	int count[3]={0,0,0};
	for(int i=0; i<(int)s.length(); i++){
		count[s[i]-'a']++;
	}
	int cmax=0, cmin=1e9;
	for(int i=0; i<3; i++){
		cmax=max(cmax, count[i]);
		cmin=min(cmin, count[i]);
	}
	if(cmax-cmin>1){
		cout << "NO" << endl;
	}else{
		cout << "YES" << endl;
	}
	return 0;
}