#include <bits/stdc++.h>
using namespace std;
int n, kangaroo[500000];
int main() {
  cin >> n;
  for (int _n = n, i = 0; i < _n; ++i) cin >> kangaroo[i];
  sort(kangaroo, kangaroo + n);
  int middle = (n / 2) - !(n % 2);
  int i = middle, j = n - 1;
  while (i >= 0 && j > middle) {
    if (kangaroo[i] * 2 <= kangaroo[j]) j--;
    i--;
  }
  cout << j + 1 << endl;
  return 0;
}
