#include <bits/stdc++.h>
using namespace std;
const int INF = 2000000000;
const double EPS = 1e-9;
int mods(int a, int b) { return (b + (a % b)) % b; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, x, notVisible = 0, A[500005];
  cin >> n;
  for (int i = 0; i < n; i++) cin >> A[i];
  sort(A, A + n);
  int j = n / 2 - 1;
  for (int i = n - 1; j >= 0; j--) {
    if (j >= 0 && A[i] >= A[j] * 2) {
      notVisible++;
      i--;
    }
  }
  cout << n - notVisible << '\n';
  return 0;
}
