#include <bits/stdc++.h>
using namespace std;
template <typename T>
string tostr(const T& t) {
  ostringstream os;
  os << t;
  return os.str();
}
long long A[100010];
long long f(long long x) { return x == 1LL ? 1LL : 2LL * x; }
int main(int argc, char* argv[]) {
  int N;
  cin >> N;
  for (int i = 0; i < N; ++i) cin >> A[i];
  sort(A, A + N);
  bool found = false;
  for (int i = 0; i < N - 1; ++i) {
    if (A[i] == A[i + 1]) continue;
    if (f(A[i]) > A[i + 1]) {
      found = true;
      break;
    }
  }
  if (found)
    puts("YES");
  else
    puts("NO");
  return 0;
}
