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.Scanner;

/**
 * User: Oleksiy Pylypenko
 * Date: 1/6/13
 * Time: 1:46 PM
 */
public class A {
    static boolean debug = !"true".equalsIgnoreCase(System.getProperty("ONLINE_JUDGE"));
    private Scanner in;
    private PrintWriter out;

    private void solve() throws IOException {
        int n = in.nextInt();
        int a[] = new int[n];
        int c = 0, v = -1;
        for (int i = 0; i < n; i++) {
            a[i] = in.nextInt();
            if (a[i] == v) {
                c++;
            } else if (c > 0) {
                c--;
            } else {
                v = a[i];
                c++;
            }
        }
        c = 0;
        for (int i = 0; i < n; i++) {
            if (a[i] == v) {
                c++;
            }
        }
        if (c > (n + 1) / 2) {
            out.println("NO");
        } else {
            out.println("YES");
        }
    }

    public static void main(String[] args) throws IOException {
        new A().exec();
    }

    private void exec() {
        if (debug) {
            try {
                System.setIn(new FileInputStream(getClass().getName() + ".in"));
            } catch (FileNotFoundException e) {
                System.out.println(e);
                System.exit(1);
            }
        }
        in = new Scanner(new InputStreamReader(System.in));
        out = new PrintWriter(System.out, true);

        try {
            if (debug) {
                while (in.hasNext()) {
                    solve();
                }
            } else {
                solve();
            }
        } catch (IOException e) {
            if (debug) {
                System.out.println(e);
                System.exit(1);
            }
        } finally {
            out.close();
            in.close();
        }
    }

}
