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;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  int n;
  cin >> n;
  int i, j;
  int a[n];
  std::map<int, int> map;
  for (i = 0; i < n; i++) {
    cin >> a[i];
    map[a[i]]++;
  }
  int dist = map.size();
  std::vector<int> v;
  for (auto it = map.begin(); it != map.end(); it++) {
    int m;
    m = it->second;
    v.push_back(m);
  }
  if (dist >= 2) {
    int valance = 0;
    int mx = v[0], sz;
    sz = v.size();
    sort(v.begin(), v.end());
    valance = v[sz - 1];
    mx = v[sz - 1];
    if ((n - mx) >= (mx - 1))
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  } else {
    if (v[0] == 1)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
