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>
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
using namespace std;
void speed() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
void file() {
  freopen("name.in", "r", stdin);
  freopen("name.out", "w", stdout);
}
const int N = 205;
const long long INF = 1e18;
const int MOD = (119 << 23) + 1;
const int DOM = 1e9 + 7;
const long double EPS = 1e-9;
int main() {
  speed();
  int T = 1;
  while (T--) {
    int n;
    cin >> n;
    int cnt[1500] = {};
    int mx = -1;
    for (int i = 1; i <= n; i++) {
      int x;
      cin >> x;
      ++cnt[x];
      mx = max(cnt[x], mx);
    }
    if (mx <= (n + 1) / 2) {
      cout << "YES\n";
    } else {
      cout << "NO\n";
    }
  }
  return 0;
}
