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 whatever //do not write package name here */

import java.io.*;
import java.util.*;


public class GFG {
	public static void main (String[] args) {
	  FastReader fr = new FastReader();
	     int n = fr.nextInt();
	     int[] a = new int[n];
	     for(int i = 0;i < n;i++) {
	         a[i] = fr.nextInt();
	     }
	     int maj_index = 0, count = 1;
	     for(int i = 1;i < n;i++) {
	         if(a[maj_index] == a[i]) count++;
	         else count--;
	         
	         if(count == 0) {
	             maj_index = i;
	             count = 1;
	         }
	     }
	     count = 0;
	     for(int i = 0;i < n;i++) {
	         if(a[maj_index] == a[i]) count++;
	     }
	     //System.out.println(maj_index);
	     if(count > (int)Math.ceil(n/2.0) && n != 1) {
	         System.out.println("NO");
	     }else{
	         System.out.println("YES");
	     }
	}
}
class FastReader {
 
    BufferedReader bf;
    StringTokenizer st;
 
    public FastReader() {
        bf = new BufferedReader(new InputStreamReader(System.in));
    }
 
    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(bf.readLine());
            } catch (Exception e) {
                System.out.println(e);
            }
        }
        return st.nextToken();
    }
 
    int nextInt() {
        return Integer.parseInt(next());
    }
 
    long nextLong() {
        return Long.parseLong(next());
    }
 
    double nextDouble() {
        return Double.parseDouble(next());
    }
 
    String nextLine() {
        String str = "";
        try {
            str = bf.readLine();
        } catch (Exception e) {
            System.out.println(e);
        }
        return str;
    }
}