#include <bits/stdc++.h>
using namespace std;
const int maxn = 1111111;
int num[maxn];
int main() {
  int i, j, n, m, k;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d", &num[i]);
  sort(num + 1, num + 1 + n);
  int ans = n;
  int tail = n;
  for (j = n / 2; j >= 1; j--) {
    if (tail >= 1 && num[tail] >= 2 * num[j]) {
      ans--;
      tail--;
    }
  }
  int ret = n;
  for (j = (n + 1) / 2; j >= 1; j--) {
    if (tail >= 1 && num[tail] >= num[j] * 2) {
      ret--;
      tail--;
    }
  }
  printf("%d\n", min(ret, ans));
}
