#include <bits/stdc++.h>
using namespace std;
const long long A = 100000000000000LL, N = 1228228;
long long a[N], l, r, c, k, i, j, n, m, o;
int check(int c) {
  j = c, k = 1;
  for (i = 0; i < c; i++) {
    while (j < n && a[i] * 2 > a[j]) j++;
    if (j == n) k = 0;
    j++;
  }
  return k;
}
int main() {
  cin >> n;
  for (i = 0; i < n; i++) scanf("%d", &a[i]);
  sort(a, a + n);
  l = 0, r = n;
  while (r - l > 1) {
    c = (l + r) / 2;
    if (check(c))
      l = c;
    else
      r = c;
  }
  if (check(l))
    cout << l + (n - l * 2) << "\n";
  else
    cout << r + (n - r * 2) << "\n";
}
