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.
The first line contains a single integer — *n* (1 ≤ *n* ≤ 5·10<sup class="upper-index">5</sup>). Each of the next *n* lines contains an integer *s*<sub class="lower-index">*i*</sub> — the size of the *i*-th kangaroo (1 ≤ *s*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">5</sup>).
n = int(input())
sizes = [int(input()) for i in range(n)]

# sort the kangaroos by size in descending order
sorted_sizes = sorted(sizes, reverse=True)

# use a dictionary to keep track of which kangaroos are held by others
held_by = {}

# iterate over the sorted kangaroos and try to place each kangaroo in the pocket of the largest possible kangaroo
visible_count = 0
for size in sorted_sizes:
    # check if this kangaroo can hold any other kangaroo
    if size not in held_by:
        # iterate over the remaining kangaroos and try to place them in this kangaroo's pocket
        for smaller_size in sorted_sizes:
            if smaller_size < size / 2:
                # we can stop iterating because the remaining kangaroos are all too small to be held
                break
            elif smaller_size not in held_by:
                # this kangaroo can be held by the current kangaroo
                held_by[smaller_size] = size
        visible_count += 1

print(visible_count)
