#include <bits/stdc++.h>
using namespace std;
int main() {
  vector<long long int> v;
  long long int n, x, i, j, c = 0;
  cin >> n;
  for (i = 0; i < n; i++) {
    scanf("%lld", &x);
    v.push_back(x);
  }
  sort(v.begin(), v.end());
  long long int sz = v.size();
  if (sz == 1)
    cout << 1 << endl;
  else {
    for (i = (sz - 1) / 2, j = sz - 1; i >= 0 && j > (sz - 1) / 2;) {
      x = 2 * v[i];
      if (v[j] >= x) {
        c++;
        j--;
        if (i == 0 || (j == ((sz - 1) / 2) - 1)) break;
      }
      i--;
    }
    cout << n - c << endl;
  }
  return 0;
}
