Yaroslav has an array that consists of n integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring elements would be distinct in a finite time.

Help Yaroslav.

Input

The first line contains integer n (1 ≤ n ≤ 100) — the number of elements in the array. The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the array elements.

Output

In the single line print "YES" (without the quotes) if Yaroslav can obtain the array he needs, and "NO" (without the quotes) otherwise.

Examples

Input

1
1


Output

YES


Input

3
1 1 2


Output

YES


Input

4
7 7 7 7


Output

NO

Note

In the first sample the initial array fits well.

In the second sample Yaroslav can get array: 1, 2, 1. He can swap the last and the second last elements to obtain it.

In the third sample Yarosav can't get the array he needs.
import java.io.IOException;
//You can include standard Java language libraries that you want use.//

import java.util.*;

public class Task{

/*	    public static StreamTokenizer in;
	    public static PrintStream out;

	    public static String readString() throws IOException {
	        in.nextToken();
	        return  in.sval;
	        }

	    public static double readDouble() throws IOException {
	        in.nextToken();
	        return in.nval;
	        }

	    public static int readInt() throws IOException {
	        in.nextToken();
	        return (int) in.nval;
	    }*/

	
     public void solution(String inputFilePath, String usrOutputFilePath ) throws IOException{    	 
//    	 in = new StreamTokenizer(new FileReader(inputFilePath) );

         Scanner rd = new Scanner(System.in);

         
         	int n = rd.nextInt();

         	int a[] = new int[n];
         	int b[] = new int[1001];         	
         	
         	for (int i = 0; i < n; i++) {
				a[i]=rd.nextInt();
				b[a[i]]++;
			}
       	       
         	int max=0;
         	
         	for (int i = 0; i < 1001; i++) {
				max = Math.max(max, b[i]);
			}
         	
         	
         	if (n%2==0)
         	{
         		if (max<=n/2)
           		 System.out.println("YES");else
               		 System.out.println("NO");           			 
         	}
         	
         	if (n%2==1)
         	{
         		if (max<=1+n/2)
           		 System.out.println("YES");else
               		 System.out.println("NO");           			 
         	}
         	
		 
    		 return;
        	 
         }

 	public static void main(String[] args) throws IOException {
		Task test = new Task();
		test.solution("in.txt", "out.txt");

	}
     
}