#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5 * (1e5 + 10);
int n, sol;
int arr[MAXN];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
  sort(arr, arr + n);
  int e = n - 1;
  for (int i = n / 2 - 1; i >= 0; i--)
    if (arr[i] * 2 <= arr[e]) {
      e--;
      sol++;
    }
  printf("%d\n", n - sol);
  return 0;
}
