#include <bits/stdc++.h>
int fcmp(const int *p1, const int *p2) { return *p1 > *p2 ? 1 : -1; }
int fcmp(const int *, const int *);
typedef int (*QSORT_UDF)(const void *, const void *);
int main() {
  int a[100001];
  long n;
  int f;
  long i;
  scanf("%ld", &n);
  f = 1;
  for (i = 0; i < n; i++) scanf("%d", a + i);
  qsort(a, n, sizeof(int), (QSORT_UDF)fcmp);
  for (i = 0; i < n - 1; i++) {
    if (a[i] == 2 && a[i + 1] == 3) {
      continue;
    }
    if (a[i] == a[i + 1]) continue;
    if (a[i] * 2 > a[i + 1]) {
      f = 0;
      break;
    }
  }
  if (f == 0)
    printf("YES");
  else
    printf("NO");
  return 0;
}
