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

public class Main {
    char[] cs;
    int[] cnt = new int[3];
    int n;
    public static void main(String[] args) {
        Main m = new Main();
        m.read();
        m.solve();
    }

    private void read() {
        Scanner sc = new Scanner(System.in);
        cs = sc.nextLine().toCharArray();
        n = cs.length;
        for (char c: cs)
            cnt[c - 'a']++;
    }

    private void solve() {
        int mx = 0, mn = 0;
        mn = Arrays.stream(cnt).min().getAsInt();
        mx = Arrays.stream(cnt).max().getAsInt();
        if (mx - mn <= 1)
            System.out.println("YES");
        else
            System.out.println("NO");
    }
}
