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::sync_with_stdio(false);
  int N;
  cin >> N;
  short A[N], max_frequency = 1, frequency = 1, prev;
  for (short i = 0; i < N; ++i) cin >> A[i];
  sort(A, A + N);
  prev = A[0];
  for (short i = 1; i < N; ++i) {
    if (A[i] == prev) {
      ++frequency;
    } else {
      max_frequency = max(frequency, max_frequency);
      frequency = 1;
      prev = A[i];
    }
  }
  max_frequency = max(frequency, max_frequency);
  if ((max_frequency - 1) > (N - max_frequency))
    cout << "NO" << endl;
  else
    cout << "YES" << endl;
  return 0;
}
