#include <bits/stdc++.h>
using namespace std;
int arr[500100];
int main() {
  int i, j, k, l, m, n, ans;
  cin >> n;
  ans = n;
  for (i = 0; i < n; i++) cin >> arr[i];
  sort(arr, arr + n);
  i = 0;
  j = n / 2;
  while (i < n / 2 && j < n) {
    if (2 * arr[i] <= arr[j]) {
      i++;
      j++;
      ans--;
    } else
      j++;
  }
  cout << ans << endl;
  return 0;
}
