#include <bits/stdc++.h>
using namespace std;
const int maxN = 5010 * 110;
int s[maxN], l, r, mark[maxN], n;
bool check(int k) {
  int cnt = 0;
  for (int i = k - 1; i >= 0; i--)
    if (s[n - i - 1] >= 2 * s[k - i - 1]) cnt++;
  return cnt == k;
}
int bs(int l, int r) {
  if (l == r)
    if (check(l))
      return l;
    else
      return 0;
  int mid = l + r + 1;
  mid /= 2;
  if (check(mid)) return bs(mid, r);
  return bs(l, mid - 1);
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> s[i];
  sort(s, s + n);
  cout << n - bs(0, n / 2) << endl;
}
