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
import java.util.*;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    String s = sc.next();
    int[] a = new int[3];
    for(int i = 0; i < s.length(); i++) {
      char c = s.charAt(i);
      if(c == 'a') a[0] += 1;
      if(c == 'b') a[1] += 1;
      if(c == 'c') a[2] += 1;
    }
    int m = Math.min(a[0], Math.min(a[1], a[2]));
    String ans = "YES";
    for(int i = 0; i < 3; i++) {
      if((a[i] != m) && (a[i] != (m + 1))) ans = "NO";
    }
    System.out.println(ans);
  }
}
