import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Scanner;



public class Main {
int n,m,mod;
int[] b;
	public static void main(String[] args){	
		new Main().ans();
	}
	int sum=0;
	private void ans() {
		Scanner sc = new Scanner(System.in);
		n =sc.nextInt();
		b= new int[n];
		for(int i=0;i<n;i++) {
			b[i] =sc.nextInt();
			sum += b[i];
		}
		Arrays.sort(b);//昇順ソート
		int t = sc.nextInt();
		for(int i=0;i<t;i++) answer(sc.nextDouble());
	}
	private void answer(double i) {
		int anstable[] = new int[b.length];
		double kari = (double)(sum/i);
	
			while(true){
			int t = 0;
			int maxcount = 0;
			for(int j = 0; j<b.length;j++){
				anstable[j] = (int)(b[j]/kari);
				t+=anstable[j];
				maxcount = Math.max(maxcount, anstable[j]);
			}
			if(t >=i){
				System.out.println(kari);
				return;
			}else{
				double anslength = 0;
				for(int j = 0 ; j<maxcount+1;j++){
					for(int k=b.length-1; k>=0;k--){
						if(anstable[k] == j){
							if(anslength < (double)(b[k]/(double)(j+1))){
								anslength = (double)(b[k]/(double)(j+1));
							}
							break;
						}
					}
				}
				kari = anslength;
			}
			}	
	}
	
}