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);
		String s = sc.next();
		int[] abc=new int[3];
		for(int i = 0; i<s.length(); i++){
			if(s.charAt(i)=='a'){
				abc[0]++;
			}else if(s.charAt(i)=='b'){
				abc[1]++;
			}else{
				abc[2]++;
			}
		}
		int ans=Math.max(Math.max(Math.abs(abc[0]-abc[1]),Math.abs(abc[0]-abc[2])),Math.abs(abc[1]-abc[2]));
		if(ans<2){
			System.out.println("YES");
		}else{
			System.out.println("NO");
		}
	}
}
