#include <bits/stdc++.h>
using namespace std;
const int N = 25;
bool fit(long long a, long long b) {
  if (a == b) return true;
  if (a * 2 > b) return false;
  return true;
}
int main(int argc, char *argv[]) {
  int n;
  cin >> n;
  long long a[n];
  for (int i = (0), _b = (n); i < (_b); ++i) cin >> a[i];
  sort(a, a + n);
  bool ok = true;
  for (int i = (0), _b = (n - 1); i < (_b); ++i) {
    if (!fit(a[i], a[i + 1])) {
      ok = false;
      break;
    }
  }
  if (ok)
    cout << "NO" << endl;
  else
    cout << "YES" << endl;
  return 0;
}
