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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;

public class Main {

  
    public static Scanner input = new Scanner(System.in);

    public static void main(String[] args)
            throws IOException {

        // BufferedReader buffer=new BufferedReader(new InputStreamReader(System.in));
        //  String str;
//         while((str=buffer.readLine())!=null){
        PrintWriter writer = new PrintWriter(new OutputStreamWriter(System.out));
//while(input.hasNextLine()){
int n=input.nextInt();

ArrayList<Integer>list=new ArrayList<Integer>();
ArrayList<Integer>list2=new ArrayList<Integer>();
ArrayList<Integer>max2=new ArrayList<Integer>();
for(int i=0;i<n;i++){
    list.add(input.nextInt());
}
int max=0;
int f=0;
for(int i=0;i<n;i++){
   if(list2.contains(list.get(i)))
       continue;
   list2.add(list.get(i));
   int fre=Collections.frequency(list, list.get(i));
 max2.add(fre);
}
      Collections.sort(max2);
      int m=max2.get(max2.size()-1);
      for(int i=0;i<max2.size()-1;i++)
      max+=max2.get(i);
      if(max>=m || (m-1)==max){
          System.out.println("YES");
          return;
      }else
        System.out.println("NO");
      
}}