#include <bits/stdc++.h>
using namespace std;
int a[1000000], n;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1);
  int i = 1, j = n / 2 + 1;
  int ans = n;
  while (true) {
    if (i > n / 2) break;
    if (j > n) break;
    if (2 * a[i] <= a[j]) {
      i++;
      j++;
      ans--;
    } else
      j++;
  }
  cout << ans;
  return 0;
}
