CF372A.Counting Kangaroos is Fun

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.

有 $n$ 只袋鼠，每只袋鼠都有一个口袋。每只袋鼠有一个大小（整数）。当且仅当“容纳”袋鼠的袋鼠的大小至少是“被容纳”袋鼠大小的两倍时，“被容纳”的袋鼠才能进入另一只袋鼠的口袋。

每只袋鼠最多只能容纳一只袋鼠，且被其他袋鼠容纳的袋鼠不能再容纳任何袋鼠。

被其他袋鼠容纳的袋鼠无法从外部看到。请设计一种袋鼠容纳方案，使得从外部可见的袋鼠数量最少。

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

第一行包含一个整数 $n$（$1 \leq n \leq 5 \cdot 10^5$）。接下来的 $n$ 行中，每行包含一个整数 $s_i$ —— 第 $i$ 只袋鼠的体型大小（$1 \leq s_i \leq 10^5$）。

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

输出一个整数——可见袋鼠的最大数量。