#include <bits/stdc++.h>
using namespace std;
long long n, a[500500];
int main() {
  cin >> n;
  long long ans = n;
  int mid = n / 2;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  for (int i = 0; i < n / 2; i++) {
    while (true) {
      if (a[i] * 2ll <= a[mid]) {
        ans--;
        mid++;
        break;
      } else {
        mid++;
      }
      if (mid == n) break;
    }
    if (mid == n) break;
  }
  cout << ans;
  return 0;
}
