#include <bits/stdc++.h>
using namespace std;
const int maxn = 500005;
int a[maxn];
int main() {
  int n;
  while (scanf("%d", &n) != EOF) {
    for (int i = 0; i < n; i++) {
      scanf("%d", &a[i]);
    }
    sort(a, a + n);
    int res = 0;
    int cnt = n - 1;
    for (int i = n / 2 - 1; i >= 0; i--) {
      if (a[i] * 2 <= a[cnt]) {
        cnt--;
      }
    }
    printf("%d\n", cnt + 1);
  }
  return 0;
}
