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.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		StringBuilder sb = new StringBuilder();
		char[] s = sc.next().toCharArray();
		int acnt = 0, bcnt = 0, ccnt = 0;
		for (int i = 0; i < s.length; i++) {
			if (s[i] == 'a') {
				acnt++;
			} else if (s[i] == 'b') {
				bcnt++;
			} else if (s[i] == 'c') {
				ccnt++;
			}
		}
		int min = Math.min(acnt, bcnt);
		min = Math.min(min, ccnt);
		acnt = acnt - min;
		bcnt = bcnt - min;
		ccnt = ccnt - min;
		if (acnt <= 1 && bcnt <= 1 && ccnt <= 1) {
			sb.append("YES");
		} else {
			sb.append("NO");
		}
		System.out.println(sb);
	}
}
