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;
typedef long long ll;
const int N=2e5+5,inf=0x3f3f3f3f;
string s;
int cnt[3]={0};
int main()
{
	cin>>s;
	for(int i=0;s[i];i++)
		cnt[s[i]-'a']++;
	sort(cnt,cnt+3);
	cnt[1]-=cnt[0];
	cnt[2]-=cnt[0];
	bool flag=true;
	if(cnt[1]>1||cnt[2]>1)
		flag=false;
	puts(flag?"YES":"NO");
    return 0;
}


