#include <bits/stdc++.h>
using namespace std;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;
int main() {
  int n;
  scanf("%d", &n);
  vector<int> arr(n);
  for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
  sort((arr).begin(), (arr).end());
  int lo = 0, hi = n;
  int ans = 0;
  while (lo <= hi) {
    int m = (lo + hi) / 2;
    int r = m;
    bool ok = true;
    for (int i = 0; i < m; i++) {
      while (r < n && arr[i] * 2 > arr[r]) r++;
      if (r == n) {
        ok = false;
        break;
      }
      r++;
    }
    if (ok) {
      ans = m;
      lo = m + 1;
    } else {
      hi = m - 1;
    }
  }
  printf("%d\n", n - ans);
  return 0;
}
