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 x, arr[1001] = {}, cop[1001] = {}, temp, a;
  vector<int> nums;
  cin >> x;
  for (int i = 0; i < x; i++) {
    cin >> a;
    ++arr[a];
    ++cop[a];
  }
  sort(cop, cop + 1001);
  for (int i = 1000; i >= 0; i--) {
    if (cop[i] != 0) {
      for (int q = 0; q < 1001; q++) {
        if (arr[q] == cop[i]) {
          while (arr[q] != 0) {
            if (nums.empty())
              nums.push_back(q);
            else {
              if (nums.size() == 1)
                nums.push_back(q);
              else {
                for (int i = 0; i < nums.size() - 1; i++) {
                  if (nums.at(i) == nums.at(i + 1)) {
                    nums.insert(nums.begin() + i + 1, q);
                    break;
                  }
                }
              }
            }
            --arr[q];
          }
          break;
        }
      }
    } else
      break;
  }
  for (int i = 0; i < nums.size() - 1; i++) {
    if (nums.at(i) == nums.at(i + 1)) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES";
  return 0;
}
