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.
#include <bits/stdc++.h>
using namespace std;
long long gcdf(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcdf(b, a % b);
}
int gcd(int a, int b, int& x, int& y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  int x1, y1;
  int d = gcd(b, a % b, x1, y1);
  x = y1;
  y = x1 - y1 * (a / b);
  return d;
}
int main() {
  int n, d, i, max;
  cin >> n;
  int a[1000] = {0};
  for (i = 0; i < n; i++) {
    cin >> d;
    a[d - 1]++;
  }
  sort(a, a + 1000);
  max = a[999];
  if (n % 2 == 0 && max <= n / 2)
    cout << "YES" << endl;
  else if (n % 2 != 0 && max <= n / 2 + 1)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
