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() {
  long long int n;
  cin >> n;
  long long int a[n];
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
  }
  if (n == 1) {
    cout << "YES\n";
    return 0;
  }
  long long int m = *max_element(a, a + n);
  long long int occ[m + 5];
  for (long long int i = 0; i <= m + 5; i++) occ[i] = 0;
  for (long long int i = 0; i < n; i++) {
    occ[a[i]]++;
  }
  sort(occ, occ + m + 1, greater<long long int>());
  long long int maxel = occ[0];
  long long int cnt = 0;
  for (long long int i = 1; i <= m; i++) {
    cnt = cnt + occ[i];
  }
  if (cnt >= maxel - 1)
    cout << "YES\n";
  else
    cout << "NO\n";
  return 0;
}
