#include <bits/stdc++.h>
using namespace std;
int bsearch(int a[], int l, int r, int x) {
  int mid;
  while (l < r) {
    mid = l + (r - l) / 2;
    if (a[mid] == x) return mid;
    if (a[mid] > x)
      r = mid - 1;
    else
      l = mid + 1;
  }
  return -1;
}
int main() {
  int x, y, z, i, j, k, n;
  cin >> n;
  int A[n];
  for (i = 0; i < n; i++) cin >> A[i];
  sort(A, A + n);
  for (i = 0; i < (n - 1); i++)
    if (A[i + 1] < (2 * A[i]) && A[i] != A[i + 1]) break;
  if (i == n - 1)
    cout << "NO\n";
  else
    cout << "YES\n";
  return 0;
}
