#include <bits/stdc++.h>
using namespace std;
const long double epsylon = 1e-9;
int cnt[1000001];
int main() {
  int n;
  cin >> n;
  vector<int> a;
  a.reserve(n);
  memset(cnt, 0, sizeof(cnt));
  for (int i = 0; i < (int)n; ++i) {
    int tmp;
    scanf("%d", &tmp);
    cnt[tmp]++;
  }
  for (int i = 1; i <= 2 * 100000; ++i) {
    for (int j = 0; j < cnt[i]; ++j) {
      a.push_back(i);
    }
  }
  int beg = 0;
  int end = n / 2 + 1;
  while (end - beg > 1) {
    int mid = (end + beg) / 2;
    bool can = true;
    for (int i = 0; i < mid; ++i) {
      if (a[n - i - 1] < 2 * a[mid - i - 1]) {
        can = false;
        break;
      }
    }
    if (can == true) {
      beg = mid;
    } else {
      end = mid;
    }
  }
  cout << (int)a.size() - beg << endl;
  return 0;
}
