#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n;
  cin >> n;
  ;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  long long c = 0, last = n / 2;
  for (long long i = 0; i < n / 2; i++) {
    while (last < n) {
      if (2 * a[i] <= a[last]) {
        last++;
        c++;
        break;
      } else
        last++;
    }
    if (last == n) break;
  }
  cout << n - c;
}
int32_t main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int q;
  q = 1;
  while (q--) {
    solve();
    cout << endl;
  }
  return 0;
}
