#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
#include <sstream>
 
#include <algorithm>
#include <cmath>
 
#include <string>
//#include <array>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////
int N;
int Len[100000];//10^5
int Lmin,Lmax;
LD ans[100000];

int f(LD norLen ){
	int res = 0;
	rep(i,N){
		res += (int)( Len[i] / norLen );
	}
	return res;
}

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    cout << setprecision(16);//
	
	cin>>N;
	Lmax = 0;
	Lmin = (int)1e9;

	rep(i,N){
		cin>>Len[i];
		Lmax = max( Lmax, Len[i] );
		Lmin = min( Lmin, Len[i] );
	}
	
	LD Right,Left,mid;
	LD pr,pl;
	LL temp;
	//２分探索
	int Q,K;
	cin>>Q;
	if( 1 == N ){
		rep(count,Q){
			cin>>K;
			ans[count] = (int)( (LD)Len[0]/K );
		}

		for(int i=0;i<Q; ++i){
			P( ans[i] );
		}
		return 0;
	}
	rep(count,Q){
		cin>>K;

		Right = Lmax;
		Left = 0;
		mid = (Right+Left) / 2;
		pr = -1;
		pl = -1;
		int nibutan = 50;
		while( nibutan-- ){
			pr = Right;
			pl = Left;
			mid = (Right+Left) / 2;
			temp = f( mid );
			if( temp >= K ){
				Left = mid;
			}else{// if( K > temp ){
				Right = mid;
			}
		}
		ans[count] = Left;
	}
	
	for(int i=0; i<Q; ++i){
		P( ans[i] );
	}

	return 0;
}