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(void){
	string s;

	cin >> s;

	int id = 0, a = 0, b = 0, c = 0;
	for (int i = 0; i < s.size(); i++){
		if (s[i] == 'a')
			a++;
		else if (s[i] == 'b')
			b++;
		else
			c++;
	}

	if (s.size() == 1){
		cout << "YES";
	}
	else if (s.size() == 2){
		if (s[0] == s[1])
			cout << "NO";
		else
			cout << "YES";
	}
	else {
		if (abs(a-b) < 2 && abs(b-c) < 2 && abs(c-a) < 2)
			cout << "YES";
		else
			cout << "NO";
	}
	cout << endl;
}