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