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<string>

int main(){
	std::string s;
	std::cin>>s;

	int numSet;
	std::vector<int> numChar(3, 0);

	for(int i=0; i< s.size(); i++)
		numChar[s[i]-'a']++;

	numSet= (s.size()-1)/3;



	for(int i=0; i<3; i++){
		if(numSet+1 < numChar[i]){
			std::cout<<"NO"<<std::endl;
			return 0;
		}
	}

	std::cout<<"YES"<<std::endl;

	return 0;
}