#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const long long LLINF = 9223372036854775807LL;
const int maxn = 100010;
int a[maxn];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
  sort(a, a + n);
  bool ok = true;
  for (int i = 0; i < n - 1; ++i) {
    if (a[i] != a[i + 1] && a[i] * 2 > a[i + 1]) ok = false;
  }
  printf(!ok ? "YES" : "NO");
  return 0;
}
