#include <bits/stdc++.h>
int b[100005];
int main() {
  int n, x, a[500005], tail = 1;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &x);
    b[x]++;
  }
  for (int i = 1; i <= 100000; i++)
    for (int j = 0; j < b[i]; j++) a[tail++] = i;
  for (int j = n / 2; j > 0; j--) {
    if (2 * a[j] <= a[n]) {
      n--;
    }
  }
  printf("%d\n", n);
  return 0;
}
