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;

void fuckit(){
	cout << "NO\n";
	exit(0);
}

int main(){
	string str;
	cin >> str;
	int a = 0;
	int b = 0;
	int c = 0;
	for(auto u : str){
		if(u == 'a') ++a;
		if(u == 'b') ++b;
		if(u == 'c') ++c;
	}
	if(max({a, b, c}) - min({a, b, c}) <= 1) cout << "YES\n";
	else cout << "NO\n";
	return 0;
}
