#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
	int num;
	scanf("%d",&num);
	vector<int>vec;
	for(int i=0;i<num;i++)
	{
		int zan;
		scanf("%d",&zan);
		vec.push_back(zan);
	}
	sort(vec.begin(),vec.end());
	int pt=num/2;
	int ans=num;
	for(int i=0;i<num/2;i++)
	{
		for(;;)
		{
			if(vec[i]*2<=vec[pt])
			{
				ans--;
				pt++;
				break;
			}
			else
			{
				pt++;
			}
			if(pt==num)
			{
				break;
			}
		}
		if(pt==num)
		{
			break;
		}
	}
	printf("%d\n",ans);
}

I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGU8dmVjdG9yPgojaW5jbHVkZTxhbGdvcml0aG0+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBtYWluKCkKewoJaW50IG51bTsKCXNjYW5mKCIlZCIsJm51bSk7Cgl2ZWN0b3I8aW50PnZlYzsKCWZvcihpbnQgaT0wO2k8bnVtO2krKykKCXsKCQlpbnQgemFuOwoJCXNjYW5mKCIlZCIsJnphbik7CgkJdmVjLnB1c2hfYmFjayh6YW4pOwoJfQoJc29ydCh2ZWMuYmVnaW4oKSx2ZWMuZW5kKCkpOwoJaW50IHB0PW51bS8yOwoJaW50IGFucz1udW07Cglmb3IoaW50IGk9MDtpPG51bS8yO2krKykKCXsKCQlmb3IoOzspCgkJewoJCQlpZih2ZWNbaV0qMjw9dmVjW3B0XSkKCQkJewoJCQkJYW5zLS07CgkJCQlwdCsrOwoJCQkJYnJlYWs7CgkJCX0KCQkJZWxzZQoJCQl7CgkJCQlwdCsrOwoJCQl9CgkJCWlmKHB0PT1udW0pCgkJCXsKCQkJCWJyZWFrOwoJCQl9CgkJfQoJCWlmKHB0PT1udW0pCgkJewoJCQlicmVhazsKCQl9Cgl9CglwcmludGYoIiVkXG4iLGFucyk7Cn0=