import sys
from heapq import heappush, heappop

def solve():
    n = int(input())
    a = list(map(int, input().split()))
    q = int(input())

    heap = []
    for i, val in enumerate(a):
        heappush(heap, (val, i))

    for _ in range(q):
        x = int(input())
        while heap[0][0] < x:
            _, idx = heappop(heap)
            print(idx + 1, end=" ")
            heappush(heap, (x, idx))
            a[idx] = x
            break
        else:
            _, idx = heap[0]
            print(idx + 1, end=" ")
            heappop(heap)
            heappush(heap, (x, idx))
            a[idx] = x

    print()

if __name__ == "__main__":
    solve()