#include <bits/stdc++.h>
using namespace std;
const int MX = 2e5;
int N, M, k;
int arr[MX];
void solve() {
  scanf("%d", &N);
  for (int i = 0; i < N; i++) {
    scanf("%d", &arr[i]);
  }
  sort(arr, arr + N);
  for (int i = 1; i < N; i++) {
    if (arr[i] == arr[i - 1]) continue;
    if (arr[i - 1] * 2 > arr[i]) {
      cout << "YES\n";
      return;
    }
  }
  cout << "NO\n";
}
int main() {
  int T = 1;
  while (T--) solve();
  return 0;
}
