#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, MAXN = 500000 + 10;
int a[MAXN], cnt[MAXN];
int main() {
  int n, mx = 0, p = 0;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    mx = max(mx, a[i]);
    cnt[a[i]]++;
  }
  for (int i = 1; i <= mx; i++) {
    while (cnt[i]) {
      cnt[i]--;
      a[p++] = i;
    }
  }
  int ans = n, sum = 0, st = (n - 1) / 2 + 1;
  p = n - 1;
  for (int i = (n - 1) / 2; i >= 0; i--) {
    int tmp = a[i] << 1;
    while (p >= st && a[p] >= tmp) p--, sum++;
    if (sum >= 1) ans--, sum--;
  }
  printf("%d\n", ans);
  return 0;
}
