#include <bits/stdc++.h>
using namespace std;
int n, s[500033];
int ans;
int canbe(int mid) {
  int i, j;
  if (mid == 0) return 1;
  for (i = mid - 1, j = n - 1; i >= 0 && j >= 0; i--, j--) {
    if (s[i] * 2 > s[j]) return 0;
  }
  return 1;
}
int main() {
  int i, j;
  int L, R, mid;
  while (scanf("%d", &n) != EOF) {
    for (i = 0; i < n; i++) scanf("%d", &s[i]);
    sort(s, s + n);
    L = 0;
    R = n / 2;
    while (L < R) {
      mid = (L + R + 1) / 2;
      if (canbe(mid) == 1)
        L = mid;
      else
        R = mid - 1;
    }
    printf("%d\n", n - L);
  }
  return 0;
}
