def solve(inp):
    h = MinHeap(key=lambda x: x[0])
    result = [None] * len(inp)
    for index, x in enumerate(inp):
        while len(h) > 0 and h.min()[0] <= x / 2:
            y = h.remove_min()
            result[y[1]] = index
        h.add((x, index))
    return result