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<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;

const int N = 100010;
char s[N];
int n, cnta, cntb, cntc;

int main()
{
	scanf("%s", s+1); int n = strlen(s+1);
	for (int i = 1; i <= n; i ++){
		if (s[i] == 'a') cnta ++;
		if (s[i] == 'b') cntb ++;
		if (s[i] == 'c') cntc ++;
	}
	//printf("%d %d %d\n", cnta, cntb, cntc);
	if ((abs(cnta-cntb) <= 1) && (abs(cnta-cntc) <= 1) && (abs(cntb-cntc) <= 1)) puts("YES");
	else puts("NO");
	return 0;
}