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.*;
import java.util.HashMap;
import java.util.Map;

public class Yeroslav {
public static void main(String[] args) throws IOException{
	BufferedReader r=new BufferedReader(new InputStreamReader(System.in));
	int n=Integer.parseInt(r.readLine());
	String[] s=(r.readLine()).split(" ");
	int[] a=new int[n];
	int[] count=new int[1001];
	Map<Integer,Integer> mp=new HashMap<Integer,Integer>();
	
	for(int i=0;i<s.length;i++){
		
		a[i]=Integer.parseInt(s[i]);
		if(mp.containsKey(a[i])){
			int val=mp.get(a[i]);
			mp.put(a[i], val+1);
		}
		else
			mp.put(a[i], 1);
		}
	
		for(Map.Entry<Integer, Integer> p:mp.entrySet()){
			if(p.getValue() > ((n>>1)+(n&1)))
					{
				System.out.println("NO");return;
					}
		}
		System.out.println("YES");
	
	
}
}
