#include <bits/stdc++.h>
using namespace std;
int kan[500100];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> kan[i];
  }
  sort(kan, kan + n);
  int l = 0, u = n / 2;
  while (l < u) {
    int m = (l + u + 1) / 2;
    bool ok = true;
    for (int i = 0; i < m; i++) {
      if (2 * kan[i] > kan[n - m + i]) {
        ok = false;
        break;
      }
    }
    if (ok) {
      l = m;
    } else {
      u = m - 1;
    }
  }
  cout << (n - l);
  return 0;
}
