#include <bits/stdc++.h>
const int INF = (1 << 29), SIZE = 1000 * 1000;
const double EPS = 1e-6;
const long long INF64 = (1LL << 62) - 1;
template <class T>
T sqr(T x) {
  return x * x;
}
using namespace std;
int n = 0;
vector<long long> a;
void in() {
  cin >> n;
  a.resize(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
}
void solve() {
  sort(a.begin(), a.end());
  for (int i = 0; i < a.size() - 1; i++) {
    if (a[i] * 2LL > a[i + 1] && a[i] != a[i + 1]) {
      cout << "YES\n";
      return;
    }
  }
  cout << "NO\n";
  return;
}
int main() {
  in();
  solve();
  return 0;
}
