#include <bits/stdc++.h>
using namespace std;
int a[500005], i, j, k, l, m, n;
int go(int x) {
  if (x == 0) return 1;
  for (int i = 1; i <= x; i++)
    if (a[i] * 2 > a[n - x + i]) return false;
  return true;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, 1 + a + n);
  l = 0;
  int r = n / 2;
  while (l < r) {
    int m = l + r + 1;
    m /= 2;
    int w = go(m);
    if (w)
      l = m;
    else
      r = m - 1;
  }
  cout << n - r << endl;
}
