#include <bits/stdc++.h>
using namespace std;
int s[500005];
int n;
void input() {
  int i;
  int so;
  for (i = 1; i <= n; i++) {
    scanf("%d", &s[i]);
  }
}
void solve() {
  int i, j;
  int kq;
  int v;
  kq = n;
  sort(s + 1, s + 1 + n);
  v = n / 2;
  for (i = 1; i <= n / 2; i++) {
    while (v <= n) {
      if (s[i] * 2 <= s[v]) {
        kq--;
        v++;
        break;
      } else {
        v++;
      }
    }
  }
  printf("%d\n", kq);
}
int main() {
  while (scanf("%d", &n) > 0) {
    input();
    solve();
  }
  return 0;
}
