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

public class YaroslaAndPermutations {

	public static void main(String[] args) {
		Scanner scan =new Scanner(System.in);
		int n=scan.nextInt();
		int[] a= new int[n];
		HashMap<Integer,Integer> h= new HashMap();
		for(int i=0;i<n;i++)
		{
			a[i]=scan.nextInt();
			if(h.containsKey(a[i])==false)
			{
				h.put(a[i], 1);
			}
			else
			{
				int b=h.get(a[i]);
				int old=b+1;
				h.put(a[i], old);
			}
		}
		//System.out.println(h);
		int temp=1;
		Set<Map.Entry<Integer, Integer>> hmap=h.entrySet();
		for(Map.Entry<Integer, Integer> data:hmap)
		{
			if(data.getValue()>(n+1)/2)
			{
				temp=0;
				break;
			}
		}
		if(temp==1) System.out.println("YES");
		else System.out.println("NO");
	}

}
