#include <bits/stdc++.h>
using namespace std;
const int MXN = 500005;
long long a[MXN], n, m, k;
bool ok(long long mid) {
  for (int i = 0; i < mid; i++) {
    if (a[i] * 2 > a[n - mid + i]) return false;
  }
  return true;
}
void solve(int cs) {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  long long lo = 0, hi = n / 2, ans = n;
  while (lo <= hi) {
    long long mid = (lo + hi + 1) >> 1;
    if (ok(mid)) {
      ans = mid;
      lo = mid + 1;
    } else
      hi = mid - 1;
  }
  cout << n - ans << endl;
}
int main() {
  int t = 1, x = 1;
  while (t--) solve(x++);
  return 0;
}
