import heapq
N=input()
L=list(map(int,input().split()))
Q=input()
K=list(map(int,input().split()))
S=max(K)+1
W=[0]*S
L.sort(reverse=True)
h=[(-w,1) for w in L]
for k in range(1,S):
 w,n=h[0]
 W[k]=-w
 heapq.heapreplace(h,(w*n/(n+1),n+1))
for k in K:print(W[k])