#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7, N = 500007;
int n, arr[N], mid, ans;
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &arr[i]);
  }
  sort(arr + 1, arr + 1 + n);
  mid = n / 2;
  for (int i = n, pos = mid; i > mid; i--) {
    while (pos > 0 && arr[pos] > arr[i] / 2) {
      pos--;
    }
    if (pos > 0 && arr[pos] <= arr[i] / 2) {
      ans++;
      pos--;
    }
    if (!pos) {
      break;
    }
  }
  cout << n - ans;
  return 0;
}
