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