#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  int cc, cc2;
  vector<int> vis(n);
  cc = 0;
  cc2 = n / 2;
  int appear = n;
  while (cc2 < n && cc < n / 2) {
    if (a[cc] * 2 <= a[cc2]) {
      appear--;
      cc++;
      cc2++;
    } else {
      cc2++;
    }
  }
  cout << appear << endl;
}
