#include <bits/stdc++.h>   using namespace std;   using ll = long long;   const int sz = 5e5 + 10;   int ar[sz];   int main() {     int n, ans;     while (cin >> n) {       for (int i = 0; i < n; i++) cin >> ar[i];       sort(ar, ar + n);       ans = n;       for (int i = n - 1, j = (n / 2) - 1; j >= 0; j--) {         if (ar[i] >= ar[j] * 2) {           ans--;           i--;         }       }       cout << ans <<   n ;     }     return 0;   }   