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

import java.util.*;



public class Main {
  static Scanner sc;
  static PrintWriter pw;
  public static int n;
  public static int a[][];
  public static boolean used[];
  public static int maxi(int x,int y)
  {
	  if (x>y)
	  return x; else return y;
  }
  
  public static void win2()
  {
	   pw.println("BitAryo");
	  pw.close();
	   System.exit(0);
  }
  public static void dfs(int k)
   {   used[k] = true;
	for (int i=0;i<n;i++)
	{
	   if ((a[k][i]==1)&&(!used[i])) dfs(i);	
	}
   }
   public static void fault()
    {  pw.print("NO");
      pw.close();
      System.exit(0); 
    }

  public static void main(String [] argv)
  {
	  sc=new Scanner(System.in);
	  pw=new PrintWriter(System.out);
      int n = sc.nextInt();
      int a[] = new int [n];
      int b[] = new int [1001];
      Arrays.fill(b,0);
      boolean pr = true;
      
      for (int i =0;i<n;i++)
    	  {a[i] = sc.nextInt();
    	   b[a[i]]++;
    	  if ((i>=1) && (a[i]!=a[i-1])) pr=false; 
    	  }
      
      if (n==1) {
    	  pw.println("YES");
    	  pw.close();
    	  System.exit(0);
      }
      if (pr) fault();
      
      boolean flag = true;
      int sum=0;
      for (int i=1;i<=1000;i++)
    	  sum+=b[i];
      for (int i=1;i<=1000;i++)
    	  if (b[i]-1>sum-b[i]) flag=false;
 
      
      if (flag)pw.println("YES"); else pw.println("NO");	  pw.close();
  }
}