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>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;

int main(){
  string s;
  cin>>s;
  int a[3]={};
  for(int i=0;i<s.size();i++){
    a[s[i]-'a']++;
  }
  int c=min({a[0],a[1],a[2]});
  r(i,3)a[i]-=c;
  sort(a,a+3);
  if(a[2]>1||a[1]>1)cout<<"NO"<<endl;
  else cout<<"YES"<<endl;
}