#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double EPS = 1e-7;
const int MAXN = 500000;
int data[MAXN + 5];
int N;
bool valid(int want_hide) {
  int idx = want_hide;
  for (int(i) = 0, (_batas) = (want_hide); (i) < (_batas); (i)++) {
    while (idx < N && data[idx] < 2 * data[i]) idx++;
    if (idx >= N) return false;
    idx++;
  }
  return true;
}
int main() {
  scanf("%d", &N);
  for (int(i) = 0, (_batas) = (N); (i) < (_batas); (i)++) scanf("%d", &data[i]);
  sort(data, data + N);
  int lo, hi, max_hide = 0;
  lo = 0;
  hi = N / 2;
  while (lo <= hi) {
    int piv = (lo + hi) / 2;
    if (valid(piv)) {
      lo = piv + 1;
      max_hide = piv;
    } else {
      hi = piv - 1;
    }
  }
  printf("%d\n", N - max_hide);
  return 0;
}
