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 a, b, c, d, e, i, j, k;
  int xx[105];
  while (~scanf("%d", &a)) {
    for (i = 0; i < a; i++) {
      scanf("%d", &xx[i]);
    }
    sort(xx, xx + a);
    int sum = 0;
    int maxx = 0;
    for (i = 0; i < a; i++) {
      sum++;
      if (i == a - 1) {
        maxx = max(maxx, sum);
        break;
      }
      if (xx[i] != xx[i + 1]) {
        maxx = max(maxx, sum);
        sum = 0;
      }
    }
    int pl = 0;
    if (a % 2 == 0) {
      a /= 2;
      if (maxx > a) {
        pl = 1;
      }
    } else {
      a /= 2;
      a++;
      if (maxx > a) {
        pl = 1;
      }
    }
    printf(pl == 1 ? "NO\n" : "YES\n");
  }
  return 0;
}
