A.cpp

#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#define vi vector<int>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>
#define F first
#define S second
#define mp map<int,int>
#define ump unordered_map <int,int>
#define ll long long int
#define pb push_back
#define mod 1000000007
#define int long long
#define pr(x) cout<<x<<'\n'; return ;
#define pry  cout<<"YES\n";return ;
#define prn  cout<<"NO\n"; return ;
#define all(v) v.begin(),v.end()
#define  loop(i,x,n) for(int i=x;i<n;i++)
#define rloop(i,n) for(int i=n-1;i>=0;i--)
#define test int t; cin>>t; while(t--)
using namespace std;
/*************************************************************************************************/
void solve()
{
    int n,ans=0;
    cin>>n;
    int a[n];
    loop(i,0,n)
    cin>>a[i];
    sort(a,a+n);
    int i,j,k;
    i=(n+1)/2-1;
    while(i>=0)
    {
        if(a[i]*2<=a[n-1])
        break;
        i--;
    }
    k=i,j=n-1;
    //cout<<i<<endl;
    while(i>=0 and j>k)
    {
        if(a[i]*2<=a[j])
        {
            i--;
            j--;
            ans++;
        }
        else 
        i--;

    }
    pr(ans+(n-ans*2))
} 
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    solve();
    return 0;
}