#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int c = 0;
  vector<int> v(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
  }
  sort(v.begin(), v.end());
  int a;
  if (n % 2 == 0) {
    a = n / 2;
  } else {
    a = n / 2 + 1;
  }
  int index = a;
  for (int i = 0; i < a; i++) {
    while (index < n && v[index] < v[i] * 2) {
      index++;
    }
    if (index >= n) {
      break;
    } else {
      c++;
      index++;
    }
  }
  cout << n - c << endl;
}
