import heapq 
def solve():
    n = int(input())
    L = list(map(int,input().split()))
    q = int(input())
    k = list(map(int,input().split()))

    h = []
    for i in range(n):
        heapq.heappush(h, (-L[i], 1, i))

    max = 500001
    a = [0.0] * max 
    for j in range(1, max):
        l, n, i = h[0]
        a[j] = -l 
        heapq.heapreplace(h, (-L[i]/(n + 1), n + 1, i))

    for k_ in k:
        print(a[k_])

solve()