#include <bits/stdc++.h>
using namespace std;
int n;
int w[120000];
int search(int x) {
  int left = 0;
  int right = n - 1;
  int ans = -1;
  while (left <= right) {
    int mid = (left + right) / 2;
    if (w[mid] > x) {
      ans = mid;
      right = mid - 1;
    } else
      left = mid + 1;
  }
  return ans;
}
int main() {
  while (scanf("%d", &n) == 1) {
    for (int i = 0; i < n; i++) {
      scanf("%d", &w[i]);
    }
    sort(w, w + n);
    bool flag = false;
    for (int i = 0; i < n; i++) {
      int idx = search(w[i]);
      if (idx == -1) continue;
      if (w[idx] < 2 * w[i]) {
        flag = true;
        break;
      }
    }
    if (flag)
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
