#include <bits/stdc++.h>
using namespace std;
multiset<int> m, second;
int a[500005];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n / 2; i++) m.insert(a[i]);
  for (int i = n / 2 + 1; i <= n; i++) second.insert(a[i]);
  int ans = 0;
  set<int>::iterator it, l;
  for (it = m.begin(); it != m.end(); ++it) {
    l = second.lower_bound(*it * 2);
    if (l == second.end()) continue;
    second.erase(l);
    ans++;
  }
  cout << ans + m.size() - ans + second.size();
}
