#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
int v[N];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> v[i];
  sort(v + 1, v + n + 1);
  int c = n, pt = n / 2 + 1;
  for (int i = 1; i <= n / 2; i++) {
    for (;;) {
      if (pt > n) break;
      if (2 * v[i] <= v[pt]) {
        c--;
        pt++;
        break;
      } else
        pt++;
    }
  }
  cout << c;
}
