#include <bits/stdc++.h>
using namespace std;
int a[600000];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  int re = n, nee = n - 1;
  if (n % 2 == 0) {
    for (int i = (n - 1) / 2; i >= 0; i--) {
      if (2 * a[i] <= a[nee]) {
        re--;
        nee--;
      }
    }
    cout << re << endl;
  } else if (n % 2 == 1) {
    for (int i = (n - 2) / 2; i >= 0; i--) {
      if (2 * a[i] <= a[nee]) {
        re--;
        nee--;
      }
    }
    cout << re << endl;
  }
  return 0;
}
