#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  vector<bool> b(n, true);
  int right = n - 1, left = n / 2 - 1, sum = 0;
  while (right >= 0 && left >= 0) {
    while (left >= 0 && (a[left] > a[right] / 2 || !b[left] || left >= right)) {
      left--;
    }
    if (left >= 0) {
      sum++;
      b[left] = false;
      b[right] = false;
      while (right >= 0 && !b[right]) {
        right--;
      }
    }
    left--;
  }
  cout << n - sum;
  return 0;
}
