#include <bits/stdc++.h>
using namespace std;
const int N = 500005;
using namespace std;
bool u[N];
int n, a[N];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + 1 + n);
  for (int i = n / 2; i; i--)
    if (!u[n] && a[i] * 2 <= a[n]) u[i] = 1, n--;
  printf("%d\n", n);
  return 0;
}
