import heapq

def solve(n, arr, q):
    min_heap = [(val, idx) for idx, val in enumerate(arr)]
    heapq.heapify(min_heap)

    for _ in range(q):
        min_val, min_idx = heapq.heappop(min_heap)
        print(min_idx + 1)  # Print 1-based index
        x = int(input())
        heapq.heappush(min_heap, (x, min_idx))

n = int(input())
arr = list(map(int, input().split()))
q = int(input())
solve(n, arr, q)