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.util.*;

/**
 * Created by TDPH5945 on 2016-05-21.
 */
public class YaroslavAndPermutations {
    public static void main(String... args) {
        Scanner scanner = new Scanner(System.in);

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

        int n = scanner.nextInt();
        int count = n;
        while(n-- >0) {
            Integer key = scanner.nextInt();
            if(!map.containsKey(key)) {
                map.put(key,0);
            }
            map.put(key,map.get(key)+1);
        }
        int[] values = new int[map.size()];
        int i = 0;
        for(Integer key : map.keySet()) {
            values[i++] = map.get(key);
        }
        Arrays.sort(values);

        int max = values[values.length-1];
        count = count%2 == 1 ? count+1 : count;
        int midd =((count) /2) +1;
        if(max < midd ) {
            System.out.println("YES");
        } else {
            System.out.println("NO");
        }
    }
}
