#include <bits/stdc++.h>
using namespace std;
int n, answer;
vector<int> a;
vector<bool> used;
void BinarySearch(int search) {
  int l = (n + 1) / 2;
  int r = n - 1;
  int middle = (l + r) / 2;
  while (l < r) {
    if (a[middle] > search) {
      l = middle + 1;
    } else {
      if (!used[middle]) {
        r = middle;
      } else {
        l = middle + 1;
      }
    }
    middle = (l + r) / 2;
  }
  if (!used[middle] && a[middle] <= search) {
    used[middle] = true;
  }
}
int main() {
  scanf("%d", &n);
  a.resize(n);
  used.resize(n);
  fill(used.begin(), used.end(), false);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  sort(a.rbegin(), a.rend());
  for (int i = 0; i < n; i++) {
    if (!used[i]) {
      used[i] = true;
      BinarySearch(a[i] / 2);
      answer++;
    }
  }
  printf("%d\n", answer);
  return 0;
}
