#include <bits/stdc++.h>
using namespace std;
int n, a[500005];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  sort(a, a + n);
  int p1, p2, res = n;
  p1 = n / 2 - 1;
  p2 = n - 1;
  while (p1 >= 0) {
    if (a[p1] <= a[p2] / 2) {
      p2--;
      res--;
    }
    p1--;
  }
  printf("%d\n", res);
  return 0;
}
