#include <bits/stdc++.h>
int cmp(const void *ka, const void *kb) {
  int a = *(int *)ka;
  int b = *(int *)kb;
  return a - b;
}
int n;
int kan[500008];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &kan[i]);
  qsort(kan, n, sizeof(int), cmp);
  int minv = 0;
  int maxv = n / 2;
  while (minv < maxv) {
    int hf = (minv + maxv + 1) / 2;
    int flg = 1;
    for (int i = 0; i < hf; i++)
      if (kan[i] + kan[i] > kan[n - hf + i]) flg = 0;
    if (flg) {
      minv = hf;
    } else {
      maxv = hf - 1;
    }
  }
  printf("%d\n", n - minv);
  return 0;
}
