#include <bits/stdc++.h>
using namespace std;
int num[500010];
bool used[500010];
int hashs[100010];
int main() {
  int n;
  while (scanf("%d", &n) != EOF) {
    for (int i = 0; i < n; ++i) {
      scanf("%d", &num[i]);
    }
    memset(used, 0, sizeof(used));
    sort(num, num + n);
    int cnt = n - 1;
    for (int i = n / 2 - 1; i >= 0; --i) {
      if (num[i] * 2 <= num[cnt]) {
        cnt--;
      }
    }
    printf("%d\n", cnt + 1);
  }
}
