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.math.BigInteger;
import java.util.*;
public class Temp3 {
	public static void main(String[] args) throws Throwable {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		int[] arr = new int[1001];
		StringTokenizer st = new StringTokenizer(br.readLine());
		for (int i = 0; i < n; i++) {
			arr[Integer.parseInt(st.nextToken())]++;
		}
		boolean flag = true;
		for (int i = 0; i < arr.length; i++) {
			if(arr[i]>0)
			{
				if(n%2==0)
				{
					if(arr[i]>n>>1)
					{
						flag = false;
						break;
					}
				}
				else
				{
					if(arr[i]>(n>>1)+1)
					{
						flag = false;
						break;
					}
				}
			}
		}
		if(flag)
			System.out.println("YES");
		else
			System.out.println("NO");
	}
}
