#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5 * 105000;
int n;
int a[MAXN];
bool can(int x) {
  if (x == 0) return true;
  if (n - x < x) return false;
  int r = n;
  for (int i = x; i >= 1; i--) {
    if (r <= x) return false;
    while (a[r] < 2 * a[i]) {
      r--;
      if (r <= x) return false;
    }
    r--;
  }
  return true;
}
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;
  while (l < r) {
    int m = (l + r + 1) / 2;
    if (can(m))
      l = m;
    else
      r = m - 1;
  }
  printf("%d", n - l);
  return 0;
}
