#include <bits/stdc++.h>
using namespace std;
const int maxn = 5 * 110000;
int size[maxn];
int main() {
  int n, non = 0;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &size[i]);
  sort(size, size + n);
  int t = n / 2, j = t;
  for (int i = 0; (i < t && j < n); i++) {
    while (j < n && size[i] * 2 > size[j]) j++;
    if (j < n && size[i] * 2 <= size[j]) {
      non++;
      j++;
    }
  }
  cout << n - non << endl;
  return 0;
}
