#include <bits/stdc++.h>
using namespace std;
int n, a[500005];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  sort(a + 1, a + n + 1);
  int l = 0, r = n >> 1, mid, ans;
  while (l <= r) {
    mid = l + r >> 1;
    int pos = mid + 1;
    bool ok = 0;
    for (int i = 1; i <= mid; i++) {
      while (a[i] * 2 > a[pos] && pos <= n) pos++;
      if (pos > n) {
        ok = 1;
        break;
      }
      pos++;
    }
    if (ok)
      r = mid - 1;
    else {
      ans = mid;
      l = mid + 1;
    }
  }
  printf("%d\n", n - ans);
  return 0;
}
