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.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Scanner;


public class A {
	static StreamTokenizer st;
	static Scanner sc;
	static BufferedReader bf;
	static PrintWriter out;
	public static void main(String[] args) throws IOException {
		begin();
			
		int n = nextInt();
		int []a = new int [1001];
		
		for (int i = 0; i < n; i++) {
			a[nextInt()]++;
		}
		int id = 0;
		int sum = 0;
			for (int i = 0; i < a.length; i++) {
				if (a[id] < a[i]) id = i;
			}
			if (Math.abs(n - 2*a[id]) == 1 || n/2 >= a[id] || n == 1){
				System.out.println("YES");
				return;
			}
		System.out.println("NO");
		out.close();
	}
	private static int nextInt() throws IOException{
		st.nextToken();
		return (int) st.nval;
	}
	private static void begin() throws IOException {
		bf = new BufferedReader(new InputStreamReader(System.in));
		st = new StreamTokenizer(bf);
		sc = new Scanner(System.in);
		out = new PrintWriter(new OutputStreamWriter(System.out));
	}

}
