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