#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
int n, a[N];
bool f(int x) {
  for (int i = 1; i <= x; ++i) {
    if (a[i] * 2 > a[n - x + i]) return false;
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  sort(a + 1, a + n + 1);
  int l = 0, r = n / 2;
  while (l < r - 1) {
    int mid = (l + r) >> 1;
    if (f(mid))
      l = mid;
    else
      r = mid;
  }
  if (f(r))
    cout << n - r;
  else
    cout << n - l;
}
