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.

/*
1 2 4
1 2 6 
1 3 6
*/


import java.util.*;
import java.io.*;
public class MyClass {
    
    public static void main(String args[]) throws Exception {
        Scanner sc = new Scanner(System.in);
        //take 2 arrays
        //one to mark lowercase and one from uppercase and try to reach the end of string//
        //if successful yes ele nbo
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = sc.nextInt();
        Map<Integer, Integer> map = new HashMap<>();
        
        if(n==1){
            System.out.println("YES"); return;
        }
        int tr = n;
        while(n-->0){
            int t = sc.nextInt();
            if(!map.containsKey(t)) map.put(t,1); else map.put(t,map.get(t)+1);
        }
        for(Map.Entry<Integer, Integer> en: map.entrySet()){
            if(en.getValue()>(tr+1)/2){
                System.out.println("NO"); return;
            }
        }
        System.out.println("YES");
    }
}
