#include <bits/stdc++.h>
const double EPS = 1e-9;
using namespace std;
bool poss(long long vis, vector<long long> v) {
  long long n = v.size();
  long long j = n - vis;
  long long i = 0;
  while (i < n - vis && j < n) {
    if (v[j] >= 2 * v[i]) {
      i++;
      j++;
    } else {
      j++;
    }
  }
  if (i != n - vis) return false;
  return true;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  vector<long long> v(n);
  for (long long i = 0; i < n; i++) {
    cin >> v[i];
  }
  sort(v.begin(), v.end());
  long long i = n / 2 + n % 2, j = n, ans = n;
  while (i <= j) {
    long long mid = i + (j - i) / 2;
    if (poss(mid, v)) {
      ans = mid;
      j = mid - 1;
    } else {
      i = mid + 1;
    }
  }
  cout << ans << endl;
  return 0;
}
