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