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;
bool isPrime(long long n) {
  if (n == 2) return true;
  if (n < 2 || n % 2 == 0) return false;
  for (long long i = 3; i * i <= n; i += 2) {
    if (n % i == 0) return false;
  }
  return true;
}
void Allah_fowk_kyd_el_mo3tden() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
struct cir {
  char ad;
  long long int x, y, rad;
};
string is(long long x) {
  string s;
  stringstream ss;
  ss << x;
  ss >> s;
  return s;
}
long long si(string n) {
  stringstream geek(n);
  long long x = 0;
  geek >> x;
  return x;
}
using namespace std;
int nozero(int x1) {
  int m = 1, k = 0, x = 0;
  while (x1 > 0) {
    k = x1 % 10;
    x += k * m;
    if (k != 0) m *= 10;
    x1 /= 10;
  }
  return x;
}
int main() {
  Allah_fowk_kyd_el_mo3tden();
  int n;
  cin >> n;
  int a[n], b[1000] = {0};
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    b[a[i] - 1]++;
  }
  for (int i = 0; i < 1000; i++)
    if (b[i] > (n + 1) / 2) {
      cout << "NO";
      return 0;
    }
  cout << "YES";
  return 0;
}
