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