#include <fstream>
#include <algorithm>
using namespace std;
long int lat[801];
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
long long int nr,x,y,z,i1,i2,i3,i,k=0;
int cautbin(int val){
    int st,dr,ans,med;
    ans=-1;
    st=1;
    dr=nr;
    while(st<=dr){
    med=(st+dr)/2;
    if(lat[med]<=val){
        ans=med;
        st=med+1;
        }else dr=med-1;
    }
    return ans;
 }

int main()
{
    fin>>nr;
    for(i=1;i<=nr;i++)fin>>lat[i];
    sort(lat+1, lat+1+nr);
    fout<<cautbin(2*lat[i1+1]-2)+1;
    return 0;

}