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.math.BigInteger;
import java.util.*;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
import java.util.stream.LongStream;
import java.util.stream.Stream;

public class Main {
    public static void main(String[] args) {
        FastScanner scr = new FastScanner();
//        int t = scr.nextInt();
//        while (t-- > 0)
        solve(scr);
    }

    static void solve(FastScanner in) {
        int n = in.nextInt();
        System.out.println(IntStream.generate(in::nextInt)
                .limit(n)
                .collect(HashMap<Integer, Integer>::new, (m, b) -> m.put(b, m.getOrDefault(b, 0) + 1), HashMap::putAll)
                .entrySet()
                .stream()
                .allMatch((a) -> a.getValue() <= (1 + n) / 2)?"YES":"NO");


    }

    static class FastScanner {
        private BufferedReader reader;
        private StringTokenizer tokinizer;


        public FastScanner() {
            initilize(System.in);
        }


        public FastScanner(String path) {
            try {
                initilize(new FileInputStream(new File(path)));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }

        private void initilize(InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
        }

        private String getToken() {
            while (tokinizer == null || !tokinizer.hasMoreTokens()) {
                try {
                    String str = reader.readLine();
                    if (str != null) tokinizer = new StringTokenizer(str);
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return tokinizer.nextToken();
        }


        public int nextInt() {
            return Integer.parseInt(getToken());
        }

        public long nextLong() {
            return Long.parseLong(getToken());
        }

        public double nextDouble() {
            return Double.parseDouble(getToken());
        }

        public String next() {
            return getToken();
        }

        public String nextLine() {
            String str = "";
            try {
                str = reader.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}
