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;

string s;
int n;
int a[30];
int ma;

int main(){
//	cin.tie(0);
//	ios::sync_with_stdio(false);
	cin >> s;
	n = s.size();
	for(int i=0; i<n; ++i)
		++a[s[i]-'a'];
	for(int i=0; i<26; ++i)
		ma = max(ma, a[i]);
	cout << (ma <= (n+2)/3 ? "YES" : "NO") << "\n";
}