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 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		int[] nums = new int[]{0,0,0};
		for(char c : s.toCharArray()) {
			if(c == 'a') {
				nums[0]++;
			} else if(c == 'b') {
				nums[1]++;
			} else {
				nums[2]++;
			}
		}
		Arrays.sort(nums);
		if(nums[2] - nums[0] < 2) {
			System.out.println("YES");
		} else {
			System.out.println("NO");
		}
	}
}
