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<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
using namespace std;
int bin[3];
char s[100000+10];
int main(){
	cin>>s;
	for(int i=0;i<strlen(s);i++)
		bin[s[i]-'a']++;
	int Min=min(bin[0],min(bin[1],bin[2]));
	bin[0]-=Min;
	bin[1]-=Min;
	bin[2]-=Min;
	if(bin[1]>=2 || bin[2]>=2 || bin[0]>=2)printf("NO\n");
	else printf("YES\n");
	return 0;
}