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
{
	public static void main(String[] args)throws Exception
	{
	    BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	    int n=Integer.parseInt(br.readLine());
	    String s=br.readLine();
	    String str[]=s.split(" ");
	    int arr[]=new int[n];
	    for(int i=0;i<n;i++)
	    arr[i]=Integer.parseInt(str[i]);
	    if(n==1)
	    {
	        System.out.println("YES");
	        return;
	    }
	    if(n==2)
	    {
	        if(arr[0]==arr[1])
	        {
	            System.out.println("NO");
	            return;
	        }
	        else
	        {
	            System.out.println("YES");
	            return;
	        }
	    }
	    for(int i=0;i<n-2;i++)
	    {
	        for(int j=0;j<n-2;j++)
	        {
	            if(arr[j]==arr[j+1])
	            {
	                int temp=arr[j+1];
	                arr[j+1]=arr[j+2];
	                arr[j+2]=temp;
	            }
	        }
	    }
	    for(int i=n-1;i>=2;i--)
	    {
	        for(int j=n-1;j>=2;j--)
	        {
	            if(arr[j]==arr[j-1])
	            {
	                int temp=arr[j-1];
	                arr[j-1]=arr[j-2];
	                arr[j-2]=temp;
	            }
	        }
	    }
	    for(int i=0;i<n-1;i++)
	    {
	        if(arr[i]==arr[i+1])
	        {
	            System.out.println("NO");
	            return;
	        }
	    }
	    System.out.println("YES");
	}
}
