#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.);
int min(int a, int b) { return (a > b ? b : a); }
int max(int a, int b) { return (a > b ? a : b); }
int abs(int a) { return (a < 0 ? -a : a); }
void sort(long long a[], int l, int r);
int main() {
  long long a[100666], m1 = 0, m2, n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, 0, n - 1);
  m2 = 0;
  for (int i = 0; i < n - 1; i++) {
    if (a[i] != a[i + 1] && 2 * a[i] > a[i + 1]) {
      cout << "YES" << endl;
      return 0;
    }
  }
  cout << "NO" << endl;
  return 0;
}
void sort(long long a[], int l, int r) {
  int i = l, j = r;
  long long x, tmp;
  x = a[(l + r) / 2];
  while (i < j) {
    while (a[i] < x) i++;
    while (a[j] > x) j--;
    if (i <= j) {
      tmp = a[i];
      a[i] = a[j];
      a[j] = tmp;
      i++;
      j--;
    }
  }
  if (j > l) sort(a, l, j);
  if (r > i) sort(a, i, r);
}
