#include <bits/stdc++.h>
using namespace std;
int kq, tmp, ii, a[1000000], n;
int main() {
  cin >> n;
  kq = n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + 1 + n);
  tmp = n / 2;
  ii = tmp;
  for (int i = n; i > tmp; i--) {
    while (ii >= 1) {
      if (a[ii] <= a[i] / 2) {
        kq--;
        ii--;
        break;
      } else
        ii--;
    }
  }
  cout << kq;
}
