#include <bits/stdc++.h>
using namespace std;
long long int modpow(long long int a, long long int n, long long int temp) {
  long long int res = 1;
  while (n > 0) {
    res = (res * res) % temp;
    if (n & 1) res = (res * a) % temp;
    n /= 2;
  }
  return res;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0)
    return (b);
  else
    return (gcd(b % a, a));
}
int main() {
  int n;
  vector<int> a;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int t;
    cin >> t;
    a.push_back(t);
  }
  sort(a.begin(), a.end());
  for (int i = 0; i < n - 1; i++) {
    while (a[i + 1] == a[i]) i++;
    if (i >= n - 1) break;
    if (2 * a[i] > a[i + 1]) {
      cout << "YES";
      return 0;
    }
  }
  cout << "NO";
  return 0;
}
