#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int M = 26;
const double pi = acos(-1.0);
const double eps = 1e-10;
long long a[N];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%lld", &a[i]);
  sort(a, a + n);
  n = unique(a, a + n) - a;
  if (n == 1)
    printf("NO\n");
  else {
    int f = 0;
    for (int i = 0; i < n - 1; i++)
      if (a[i] * 2 > a[i + 1]) {
        f = 1;
        break;
      }
    printf("%s\n", f ? "YES" : "NO");
  }
  return 0;
}
