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 <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
using namespace std;
string s;
int main()
{
	int a[3];
	while(cin>>s){
		int len=s.length();
		a[0]=a[1]=a[2]=0;
		for(int i=0;i<len;i++){
			if(s[i]=='a')
				a[0]++;
			else if(s[i]=='b')
				a[1]++;
			else 
				a[2]++;
		}
		sort(a,a+3);
		//cout<<a[0]<<a[1]<<a[2];
		if(a[2]-a[1]<=1&&a[1]-a[0]<=1&&a[2]-a[0]<=1)
			puts("YES");
		else
			puts("NO");
	}
}
