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<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

const int maxn = 100000 + 10;
char s[maxn];

int a[10];

int cmp(int a, int b)
{
	return a > b;
}

int main()
{
	while(scanf("%s",s) == 1)
	{
		memset(a,0,sizeof(a));
		for(int i = 0; i < strlen(s); i++)
			a[s[i] - 'a']++;

		int ok = 1;
		sort(a,a+3,cmp);
		if(a[0] - a[1] > 1) ok = 0;
		if(a[0] - a[2] > 1) ok = 0;
		if(ok) printf("YES\n");
		else printf("NO\n");
	}
	return 0;
}