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 <string.h>

int min(int a, int b) {
  return a < b ? a : b;
}

int main(void) {
  int i, c[3] = {0, 0, 0};
  char s[100010];
  scanf("%s", s);
  for(i = 0; i < strlen(s); ++i) c[s[i] - 'a']++;
  int t = min(c[0], min(c[1], c[2]));
  c[0] -= t, c[1] -= t, c[2] -= t;
  for(i = 0; i < 3; ++i) if(c[i] > 1) {
    printf("NO");
    return 0;
  }
  printf("YES");
  return 0;
}