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>
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)

using namespace std;
string S;
int cnt[3],ans[3];
int main(){
	cin>>S;
	int n=(int)S.size();
	REP(i,n){
		cnt[S[i]-'a']++;
	}
	sort(cnt,cnt+3);
	REP(i,3){
		ans[i]=n/3+(n%3>i);
	}
	sort(ans,ans+3);
	bool f=true;
	REP(i,3){
		f&=cnt[i]==ans[i];
	}
	cout<<(f ? "YES" :"NO")<<endl;
}