#include <bits/stdc++.h>
using namespace std;
int n, a[100005];
int ans = 0x7fffffff;
int main() {
	cin>>n;
	for (int i = 1; i <= n; i++) cin>>a[i];
	sort(a + 1, a + n + 1);
	for (int i = 1; i <= n; i++) {
		int* s = upper_bound(a + 1, a + n + 1, a[i] * 2);
		ans = min(ans, (int)(a + i - s + n));
	}
	cout<<ans;
	return 0;
}