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<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
#include<functional>

using namespace std;

int main() {
	char S[100001];
	int a, b, c;
	int m1, m0;
	scanf("%s", S);

	a = 0; b = 0; c = 0;
	for (int i = 0; i < strlen(S); i++) {
		if (S[i] == 'a') { a++; }
		if (S[i] == 'b') { b++; }
		if (S[i] == 'c') { c++; }
	}

	m1 = a; m0 = a;
	if (m1 < b) { m1 = b; }
	if (m1 < c) { m1 = c; }

	if (m0 > b) { m0 = b; }
	if (m0 > c) { m0 = c; }
	
	if (m1 - m0 <= 1) { printf("YES\n"); }
	else { printf("NO\n"); }

}