#include <bits/stdc++.h>
using namespace std;
int a[555555], l, r;
int main() {
  int n, ans = 0, m = 0;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  sort(a + 1, a + n + 1);
  m = (n + 1) / 2 + 1;
  for (int i = 1; i <= n / 2; i++) {
    while (m <= n && a[i] + a[i] > a[m]) m++;
    if (m > n) break;
    ans++;
    m++;
  }
  cout << n - ans;
  return 0;
}
