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 <stdio.h>
#include <algorithm>
using namespace std;
int main(){
char c[1000000];
int a[3];
for(int i=0;i<3;i++)a[i]=0;
for(int i=0;i<1000000;i++)c[i]='\0';
scanf("%s",c);
for(int i=0;c[i]!='\0';i++)a[c[i]-'a']++;
sort(a,a+3);
if(a[2]-a[0]<=1)printf("YES\n");
else printf("NO\n");
}