#include <bits/stdc++.h>
using namespace std;
typedef int arr[500001];
arr a;
int cnt[100001];
int n, i, l = 0, r, m, value;
bool can(int k) {
  for (i = 0; i < k; i++)
    if (a[i] + a[i] > a[n - k + i]) return false;
  return true;
}
int main() {
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%d", &value);
    cnt[value]++;
  }
  n = 0;
  for (i = 1; i <= 100000; i++)
    while (cnt[i]--) a[n++] = i;
  r = n / 2;
  while (r > l) {
    m = r - (r - l) / 2;
    if (can(m))
      l = m;
    else
      r = m - 1;
  }
  printf("%d", n - l);
  return 0;
}
