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;
#define BUF (100005)
#define ll long long 

char s[BUF];
int n;
int cnt[3];

int main(void){
	cin >> s;

	for(int i=0;i<strlen(s);i++) cnt[s[i]-'a']++;

	int f=1;
	
	if(abs(cnt[2]-cnt[1])>1) f=0;
	if(abs(cnt[1]-cnt[0])>1) f=0;
	if(abs(cnt[0]-cnt[2])>1) f=0;

	if(f) cout << "YES";
	else cout << "NO";	
	return 0;
}
