#include <bits/stdc++.h>
using namespace std;
const int MAX = 1000006;
int a[MAX], n;
bool check(int k) {
  int p2 = n - 1, p1 = k - 1;
  while (p1 >= 0) {
    while (a[p1] < 2 * a[p2]) {
      p1--;
      if (p1 < 0) return false;
    }
    p1--;
    p2--;
    if (p2 < k) return true;
  }
  return false;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n, greater<int>());
  int left = 0, right = n;
  while (left < right) {
    int mid = (left + right) / 2;
    if (check(mid))
      right = mid;
    else
      left = mid + 1;
  }
  left--;
  cout << right;
  return 0;
}
