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.
//package com.company;

import java.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        HashMap<Integer,Integer> h = new HashMap<>();
        int x=0;
        for(int i=0;i<n;i++){
            x = sc.nextInt();
            if(h.containsKey(x)){
                h.put(x,h.get(x)+1);
            }
            else{
                h.put(x,1);
            }
        }
        int max = (n%2==0)?n/2:(n/2)+1;
        boolean logic = true;
        for(int e:h.keySet()){
            //System.out.println(e+" "+h.get(e) + " "+Math.abs(n-h.get(e)-h.get(e)));
            if(h.get(e)>max){
                logic = false;
                break;
            }
        }
        if(logic)
            System.out.print("YES");
        else
            System.out.print("NO");
    }
}