#include <bits/stdc++.h>
using namespace std;
int n, ar[5 * 100005], ans;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &ar[i]);
  }
  sort(ar + 1, ar + n + 1);
  int bas = n, son = n / 2;
  while (bas > n / 2 && son > 0) {
    if (2 * ar[son] <= ar[bas]) {
      bas--;
      ans++;
    }
    son--;
  }
  printf("%d", n - ans);
}
