#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  long long int n;
  cin >> n;
  long long int i, j, k, count = 0;
  vector<long long int> s(n + 1);
  for (i = 1; i <= n; i++) cin >> s[i];
  sort(s.begin() + 1, s.end());
  vector<long long int>::iterator iter = s.begin() + n / 2 + 1, iter1, iter2;
  for (i = 1; i <= n / 2; i++) {
    iter2 = lower_bound(iter, s.end(), s[i] * 2);
    if (iter2 != s.end()) {
      s[i] = 0;
      iter = iter2 + 1;
    }
  }
  for (i = 1; i <= n; i++)
    if (s[i] != 0) count++;
  cout << count;
  return 0;
}
