#include <bits/stdc++.h>
using namespace std;
long long A[500005];
int main() {
  long long n;
  cin >> n;
  for (long long i = 0; i < n; i++) {
    cin >> A[i];
  }
  queue<long long> q;
  sort(A, A + n, greater<long long>());
  for (long long i = 0; i < n / 2; i++) {
    q.push(A[i]);
  }
  for (long long i = n / 2; i < n && !q.empty(); i++) {
    if (A[i] * 2 <= q.front()) {
      q.pop();
    }
  }
  cout << (n / 2) + (n % 2) + q.size() << endl;
}
