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 A296 {
  static FastScanner in;
  static FastPrinter out;
  
  public static void main(String[] args) throws IOException {
    in = new FastScanner(System.in);
    out = new FastPrinter(System.out);
    
    int n = in.nextInt();
    int[] cnt = new int[1000];
    for (int i = 0; i < n; i++)
      cnt[in.nextInt() - 1]++;
    
    boolean possible = true;
    for (int i : cnt) {
      if (i > ((n + 1) / 2)) {
        possible = false;
      }
    }
    if (possible) {
      out.println("YES");
    } else {
      out.println("NO");
    }
    
    out.close();
  }
  
  static class FastPrinter extends PrintWriter {
    public FastPrinter(File f) throws IOException {
      super(new BufferedWriter(new FileWriter(f)));
    }
    
    public FastPrinter(OutputStream out) throws IOException {
      super(new BufferedWriter(new OutputStreamWriter(out)));
    }
  }
  
  static class FastScanner {
    BufferedReader br;
    StringTokenizer st;
    
    public FastScanner(InputStream in) {
      br = new BufferedReader(new InputStreamReader(in));
      st = new StringTokenizer("");
    }
    
    public int nextInt() throws IOException {
      return Integer.parseInt(next());
    }
    
    public long nextLong() throws IOException {
      return Long.parseLong(next());
    }
    
    public double nextDouble() throws IOException {
      return Double.parseDouble(next());
    }
    
    public String next() throws IOException {
      if (st.hasMoreTokens()) return st.nextToken();
      st = new StringTokenizer(br.readLine());
      return next();
    }
  }
  
}
