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.util.*;
 
/**
 * YaroslavAndPermutations_296A
 * @author: av-sharma
 */
 
public class YaroslavAndPermutations_296A {
	final static double PI = Math.PI;
	final static int MOD = 1000000007;
 
	public static void main(String[] args) {
		try {
			FileOutputStream fo = new FileOutputStream("out");
			PrintStream ps = new PrintStream(fo);
			InputStream is = new FileInputStream("in");
			System.setIn(is);
			System.setOut(ps);
		} catch (Exception e) {
			// e.printStackTrace();
		}
 
		FastReader fr = new FastReader();
		int n = fr.nextInt();
		Map<Integer, Integer> freqMap = new HashMap<>();
		for (int i = 0; i < n; i++) {
			int num = fr.nextInt();
			if (freqMap.containsKey(num)) freqMap.put(num, freqMap.get(num) + 1);
			else freqMap.put(num, 1);
		}

		boolean flag = true;
		for (Map.Entry<Integer, Integer> num : freqMap.entrySet()) {
			if (num.getValue() > (n + 1) / 2) {
				flag = false;
				break;
			}
		}

		System.out.println(flag ? "YES" : "NO");
	}
}
 
// FastReader Util Class
class FastReader {
	BufferedReader br;
	StringTokenizer st;
 
	public FastReader() {
		br = new BufferedReader(new InputStreamReader(System.in));
	}
 
	String next() {
		while (st == null || !st.hasMoreElements()) {
			try {
				st = new StringTokenizer(br.readLine());
			} catch (IOException e) {
				e.printStackTrace();
			}
		}
		return st.nextToken();
	}
 
	String nextLine() {
		String str = "";
		try {
			str = br.readLine();
		} catch (Exception e) {
			e.printStackTrace();
		}
		return str;
	}
 
	int nextInt() {
		return Integer.parseInt(next());
	}
 
	Long nextLong() {
		return Long.parseLong(next());
	}
 
	Double nextDouble() {
		return Double.parseDouble(next());
	}
}
