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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class A296 {

	
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int N = Integer.parseInt(br.readLine());
		int cnt [] = new int[1010];
		StringTokenizer st = new StringTokenizer(br.readLine());
		for(int i = 0;i < N;i++)
			cnt[Integer.parseInt(st.nextToken())]++;
		int max = 0;
		for(int i = 0; i < cnt.length;i++)
			max = Math.max(cnt[i],max);
		int dif = N - max;
		String res = "";
		if(N % 2 == 0){
			if(max <= dif)
				res = "YES";
			else
				res = "NO";
		}else{
			if(max <= dif + 1)
				res = "YES";
			else
				res = "NO";
		}
		System.out.println(res);	
		
		

	}

}
