#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int p(int m, vector<int> &s, int n) {
  for (int i = 0, j = n - m; i < m; i++, j++)
    if (2 * s[i] > s[j]) return 0;
  return 1;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  int n;
  cin >> n;
  vector<int> s(n);
  for (int &x : s) cin >> x;
  sort(begin(s), end(s));
  int l = 0, r = n / 2, m;
  while (l < r) {
    m = (l + r + 1) / 2;
    if (p(m, s, n))
      l = m;
    else
      r = m - 1;
  }
  cout << n - l << "\n";
}
