#include <bits/stdc++.h>
using namespace std;
int main() {
  vector<int> kangaroos;
  int kangaroo;
  int N;
  cin >> N;
  int n = N;
  while (n--) {
    cin >> kangaroo;
    kangaroos.push_back(kangaroo);
  }
  bool flag = false;
  sort(kangaroos.begin(), kangaroos.end());
  int len = kangaroos.size() / 2 - 1;
  for (int i = kangaroos.size() - 1; i >= kangaroos.size() / 2; --i) {
    if (flag) break;
    int j;
    for (j = len; j >= 0; j--) {
      if (kangaroos[j] != -1 && kangaroos[j] * 2 <= kangaroos[i]) {
        N--;
        kangaroos[j] = -1;
        len = j - 1;
        break;
      }
    }
    if (j == -1) flag = true;
  }
  cout << N << endl;
  return 0;
}
