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;

public class Problem_296A {
	
	public Problem_296A() { }
	
	public int getInput(int [] a) {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try {
			int n = Integer.parseInt(br.readLine());
			String [] element = br.readLine().split(" ");
			for (int i = 0; i < n; i++) a[i] = Integer.parseInt(element[i]);
			return n;
		}
		catch (IOException e) { }
		return 0;
	}
	
	public int organizeElement(int [] a, int size, int [] element, int [] repetition) {
		int count = 1;
		element[0] = a[0];
		repetition[0] = 1;
		for (int i = 1; i < size; i++) {
			int j;
			for (j = 0; j < count; j++) {
				if (a[i] == element[j]) { 
					repetition[j]++;
					break;
				}
			}
			if (j == count) {
				element[count] = a[i];
				repetition[count++] = 1;
			}
		}
		return count;
	}
	
	public  void swap(int [] a, int x, int y) {
	    int temp = a[x];
	    a[x] = a[y];
	    a[y] = temp;
	}
	
	public void sortRepetition(int [] element, int [] repetition, int size) {
		for (int i = 0; i < size - 1; i++) {
			for (int j = i + 1; j < size; j++) {
				if (repetition[i] < repetition[j]) {
					swap(repetition, i, j);
					swap(element, i, j);
				}
			}
		}
	}
	
	public String processData(int [] a, int size) {
		if (a[0] == 1) return "YES";										// prevent the size being too small
		int counter = a[0];
		int position = counter + 1;
		Boolean flag = false;
		for (int i = 1; i < size; i++) {
			position -= a[i];
			if (position > 2 && flag == false) { 
				continue;
			}
			else {
				return "YES";
			}
		}
		return "NO";
	}
	
	public static void main(String [] args) throws NullPointerException{
		Problem_296A process = new Problem_296A();
		int [] a = new int[100];
		int [] element = new int[100];
		int [] repetition = new int[100];
		int n = process.getInput(a);
		int k = process.organizeElement(a, n, element, repetition);
		process.sortRepetition(element, repetition, k);
		System.out.println(process.processData(repetition, k));
	}
}
