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

public class Main {
    
    public static boolean solve(String s){
    	int a=0,b=0,c=0;
    	for(int i=0;i<s.length();i++){
    	    char l = s.charAt(i);
    	    if(l=='a') a++;
    	    else if(l=='b') b++;
    	    else c++;
    	}
    	
    	
    	if(a==b) return -1<=a-c && a-c<=1;
    	if(a-b==1||b-a==1) return c==a || c==b;
    	return false;
    	
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String given = sc.next();
        
        System.out.println(solve(given) ? "YES" : "NO");
        
    }
}