#include <bits/stdc++.h>
using namespace std;
bool used[500005];
int a[500005];
int sorter[100005];
int main() {
  int n, x;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &x);
    sorter[x] += 1;
  }
  int k = 0;
  for (int i = 0; i < 100005; ++i) {
    for (int j = 0; j < sorter[i]; ++j) a[k++] = i;
  }
  int half = n / 2;
  int rp = half;
  int res = n;
  for (int i = 0; i < half; ++i) {
    int sz = a[i] * 2;
    for (; rp < n && a[rp] < sz; ++rp)
      ;
    if (rp == n) {
      break;
    } else {
      res -= 1;
      rp += 1;
    }
  }
  printf("%d", res);
  return 0;
}
