import sys

# sys.setrecursionlimit(1000005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

from heapq import *

n = II()
ll = LI()
q = II()
kk = LI()

cc = [1]*n
hp = []
for i, l in enumerate(ll):
    heappush(hp, (-l, i))

aa = []
for _ in range(max(kk)):
    l, i = heappop(hp)
    aa.append(-l)
    cc[i] += 1
    heappush(hp, (-ll[i]/cc[i], i))

for k in kk: print(f"{aa[k-1]:.10f}")