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 b[1010];
int main() {
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    b[a[i]]++;
  }
  sort(b, b + 1010, greater<int>());
  vector<int> v;
  for (int i = 0;; i++) {
    if (b[i] != 0) {
      v.push_back(i);
      b[i]--;
    }
    if (i == 1000) i = -1;
    if (v.size() == n) break;
  }
  int d = 0;
  for (int i = 1; i < n; i++) {
    if (v[i] == v[i - 1]) d++;
  }
  for (int i = 0; i < n - 1; i++) {
    if (v[i] != v[n - 1] && v[i + 1] != v[n - 1] && v[i] != v[i + 1]) d--;
  }
  if (d <= 0)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
