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 <bits/stdc++.h>
using namespace std;
char S[120000]; int n,a[3],x,y;
int main(){
	scanf("%s",S); n=strlen(S);
	for (int i=0;i<n;++i) ++a[S[i]-'a'],x=max(x,a[S[i]-'a']);
	if (x-a[0]>1||x-a[1]>1||x-a[2]>1) puts("NO"); else puts("YES");
	return 0;
}