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;
struct da {
  int a, b;
};
vector<int> v[100003];
int v1[100003];
da dfs(int s, int p) {
  da q, r;
  q.a = q.b = r.a = r.b = 0;
  for (int i = 0; i < v[s].size(); i++) {
    int l = v[s][i];
    if (l != p) {
      da sa = dfs(l, s);
      q.a = min(sa.a, q.a);
      q.b = max(sa.b, q.b);
    }
  }
  int res = v1[s] - (q.a + q.b);
  if (res < 0)
    q.a += res;
  else
    q.b += res;
  return q;
}
using namespace std;
int main() {
  int n;
  cin >> n;
  int a[n + 1];
  int mp[1004];
  memset(mp, 0, sizeof mp);
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    mp[a[i]]++;
  }
  int s = n / 2;
  if (n % 2 == 1) s++;
  for (int i = 1; i <= n; i++) {
    if (mp[a[i]] > s) {
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "YES" << endl;
  return 0;
}
