Codeforces Round ＃219 （Div. 2 ）-----贪心--思维

 Counting Kangaroos is Fun

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 372A

Description

There are n kangaroos with pockets. Each kangaroo has a size (integer number). A kangaroo can go into another kangaroo's pocket if and only if the size of kangaroo who hold the kangaroo is at least twice as large as the size of kangaroo who is held.

Each kangaroo can hold at most one kangaroo, and the kangaroo who is held by another kangaroo cannot hold any kangaroos.

The kangaroo who is held by another kangaroo cannot be visible from outside. Please, find a plan of holding kangaroos with the minimal number of kangaroos who is visible.

Input

The first line contains a single integer — n(1 ≤ n ≤ 5·10⁵). Each of the next n lines contains an integer s_i — the size of the i-th kangaroo (1 ≤ s_i ≤ 10⁵).

Output

Output a single integer — the optimal number of visible kangaroos.

Sample Input

Input

8
2
5
7
6
9
8
4
2

Output

5

Input

8
9
1
6
2
6
5
8
3

Output

5

就是给n各袋鼠的袋子大小，一个袋鼠袋子是另一个的两倍以上是就可以把小的装进去，装进去之后从外边就看不到了，每个袋鼠只能装一个，问最少能看见多少个，升序排列，从中间开始，前半段与后半段比较就可以了

#include<cstdio>
#include<algorithm>
using namespace std;
#define maxn 500005
int s[maxn];
int main(){
	int n;
	scanf("%d", &n);
	for(int i = 0; i < n; i++){
		scanf("%d", &s[i]);
	}
	sort(s, s+n);
	for(int i = n/2 - 1; i >= 0; i--){
		if(s[i]*2 <= s[n-1]){
			n--;
		}
	}
	printf("%d\n", n);
	return 0;
}