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.*;

public class Solution_1 {
	public static void main(String[] args) {
//		solution start :-)
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
// 		int k = sc.nextInt();
        Map<Integer,Integer> m = new HashMap<>();
		int a[] = new int[n];
		for(int i=0;i<n;i++){
		    a[i] = sc.nextInt();
		    if(m.containsKey(a[i])) m.put(a[i],m.get(a[i])+1);
		    else m.put(a[i],1);
		}
		int max = 0;
		for(Integer i: m.keySet()){
		    if(m.get(i)>max){
		        max = m.get(i);
		    }
		}
		if(n%2==0 && ((2*max)<=n)){
		    System.out.println("YES");
		}
		else if(n%2!=0 && ((2*max)<=(n+1))) System.out.println("YES");
		else System.out.println("NO");
//		solution end \(^-^)/
//		                |
//		               / \
		}
	}