#include <bits/stdc++.h>
using namespace std;
double pi = 3.1415926536;
const int oo = (int)1e9;
const long long OO = numeric_limits<long long>::max();
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int di[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dj[] = {1, -1, 0, 0, 1, -1, 1, -1};
int f1[] = {0, 0, 0, 1, 1, 1, -1, -1, -1};
int f2[] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
bool vis[20000];
int main() {
  ios_base ::sync_with_stdio(false);
  cout.setf(ios::fixed);
  int n;
  cin >> n;
  vector<int> myvec(n);
  for (int i = 0; i < n; i++) cin >> myvec[i];
  sort((myvec).begin(), (myvec).end());
  for (int i = 1; i < n; i++) {
    if (myvec[i] / 2 < myvec[i - 1] && myvec[i - 1] != myvec[i]) {
      cout << "YES";
      return 0;
    }
  }
  cout << "NO";
}
