#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int main() {
	int N; cin >> N;
	vector<int> L(N);
	for (int i = 0; i < N; i++) cin >> L[i];
	int Q; cin >> Q;
	vector<int> K(Q);
	for (int j = 0; j < Q; j++) cin >> K[j];
	priority_queue<double, vector<double>, greater<double>> pq;
	for (int i = 0; i < N; i++) {
		for (int k = 1; k <= 500000; k++) {
			double x = (double)L[i] / k;
			if (pq.size() == 500000) {
				if (x <= pq.top()) break;
				else pq.pop();
			}
			pq.push((double)L[i] / k);
		}
	}
	vector<double> a(500001);
	for (int i = 500000; i >= 1; i--) {
		a[i] = pq.top(); pq.pop();
	}
	for (int j = 0; j < Q; j++)
		printf("%.15f\n", a[K[j]]);
}