#include <bits/stdc++.h>
using namespace std;
int n, a[500010];
inline bool check(int x) {
  for (int i = 1; i <= n - x; ++i) {
    if (a[i] > (a[x + i] / 2)) return false;
  }
  return true;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1);
  int l = (n + 1) / 2, r = n, res = n;
  while (l <= r) {
    int mid = l + r >> 1;
    if (check(mid))
      r = mid - 1, res = mid;
    else
      l = mid + 1;
  }
  printf("%d\n", res);
  return 0;
}
