#include <bits/stdc++.h>
using namespace std;
int a[500010];
bool check(int mid, int n) {
  if (mid * 2 > n) return false;
  for (int i = 1; i <= mid; ++i) {
    if (a[i] * 2 > a[n - mid + i]) {
      return false;
    }
  }
  return true;
}
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1);
  int left = 0, right = n / 2;
  while (left <= right) {
    int mid = (left + right) >> 1;
    if (check(mid, n)) {
      left = mid + 1;
    } else {
      right = mid - 1;
    }
  }
  cout << n - right << endl;
  return 0;
}
