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>).
# from: https://codeforces.com/problemset/problem/372/A

import unittest
import io
import os
import sys
from atexit import register
import random
import math
import itertools

input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
sys.stdout = io.BytesIO()
register(lambda: os.write(1, sys.stdout.getvalue()))

tokens = []
tokens_next = 0

def nextStr():
    global tokens, tokens_next
    while tokens_next >= len(tokens):
        tokens = input().split()
        tokens_next = 0
    tokens_next += 1

    if type(tokens[tokens_next - 1]) == str:
        return tokens[tokens_next - 1]
    return tokens[tokens_next - 1].decode()


def nextInt():
    return int(nextStr())


def nextIntArr(n):
    return [nextInt() for i in range(n)]


def print(*argv, end='\n'):
    for arg in argv:
        sys.stdout.write((str(arg) + ' ').encode())
    sys.stdout.write(end.encode())

def OptimalKangarooCount(a): 
    a = sorted(a)
    half = len(a) // 2
    left = 0
    right = half
    res = 0
    while left < half and right < len(a):
        if a[left] * 2 <= a[right]:
            res += 1
            left += 1
            right += 1
        else:
            res += 1
            right += 1

    return res + (half - left) + (len(a) - right)


class CoutingKangaroosTest(unittest.TestCase):
    def test_GivenTests(self):
        self.assertEqual(OptimalKangarooCount([2, 4, 6, 8]), 2) # reduced version of the first case
        self.assertEqual(OptimalKangarooCount([2, 5, 7, 6, 9, 8, 4, 2]), 5)
        self.assertEqual(OptimalKangarooCount([9, 1, 6, 2, 6, 5, 8, 3]), 5)
        
    def test_TwoKangaroos(self):
        self.assertEqual(OptimalKangarooCount([2, 3]), 2)
        self.assertEqual(OptimalKangarooCount([2, 4]), 1)
        
    def test_ThreeKangaroos(self):
        self.assertEqual(OptimalKangarooCount([2, 4, 3]), 2)

    def test_MustMergeWithLeastPossibleCandidate(self):
        self.assertEqual(OptimalKangarooCount([4, 5, 8, 10]), 2)

if __name__ == "__main__":
    # unittest.main()

    a = nextIntArr(nextInt())
    print(OptimalKangarooCount(a))
    sys.stdout.flush()
