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() {
  int n;
  cin >> n;
  int* arr = new int[n];
  for (int i = 0; i < n; i++) cin >> arr[i];
  map<int, int> myMap;
  vector<int> v;
  for (int i = 0; i < n; i++) {
    myMap[arr[i]]++;
  }
  map<int, int>::iterator iter;
  for (iter = myMap.begin(); iter != myMap.end(); iter++) {
    v.push_back(iter->second);
  }
  bool ok = true;
  sort(v.begin(), v.end());
  if (v[v.size() - 1] == 1)
    ok = true;
  else {
    int sum = 0;
    for (int i = 0; i < v.size() - 1; i++) {
      sum += v[i];
    }
    if (v[v.size() - 1] > sum + 1) ok = false;
  }
  if (ok)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
