rt

int n, ans;
multiset<int> num;
inline void solve() {
	cin>>n;
	for(int i = 1, x ; i <= n ; i ++) {
		cin>>x;
		num.insert(x);
	}
	while(num.size() >= 2) {
		int beg = *num.begin();
		num.erase(num.begin());
		multiset<int> :: iterator it = num.lower_bound(beg << 1);
		if(*it >= (beg << 1)) {
			ans ++, num.erase(it);
		} else {
			cout<<ans;
			return;
		}		
	}
	cout<<ans;
	return;
}