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.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

public class Main {

    public static void main(String[] args) throws IOException {

        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));

        int n = Integer.parseInt(in.readLine());

        if (n == 1) {
            System.out.println("YES");
            return;
        }

        int max = n % 2 == 0 ? n / 2 : n / 2 + 1;

        int[] arr = new int[n + 1];
        Arrays.fill(arr, 0);

        Map<Integer, Integer> map = new HashMap();

        StringTokenizer stk = new StringTokenizer(in.readLine());
        for (int i = 0; i < n; i++) {
            int curr = Integer.parseInt(stk.nextToken());
            if (map.containsKey(curr)) {
                map.replace(curr, map.get(curr) + 1);
                continue;
            }
            map.put(curr, 1);
        }

        for (Integer value : map.values()) {
            if (value > max) {
                System.out.println("NO");
                return;
            }
        }
        System.out.println("YES");
    }
}