#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef pair< int, int > pii;
typedef vector< pii > vp;
typedef vector< double > vd;
typedef vector< vd > vvd;
typedef vector< string > vs;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;

const int MAXN = ( int ) 1e5;
const int MAXQ = ( int ) 1e5;

int N;
int L[ MAXN ];
int Q;
int K[ MAXQ ];

void init(){
  cin >> N;
  for( int i = 0; i < N; ++i )
    cin >> L[ i ];
  cin >> Q;
  for( int i = 0; i < Q; ++i )
    cin >> K[ i ];
}

const int MAXK = ( int ) 5e5;

double ans[ MAXK + 1 ];

void preprocess(){

  priority_queue< tuple< double, int, int > > pq;
  for( int i = 0; i < N; ++i )
    pq.emplace( 1.0 * L[ i ], i, 1 );
  for( int quantity = 1; quantity <= MAXK; ++quantity ){
    double len; int id, q; tie( len, id, q ) = pq.top(); pq.pop();
    ans[ quantity ] = len;
    pq.emplace( 1.0 * L[ id ] / ( q + 1 ), id, q + 1 );
  }
}

void solve(){
  for( int i = 0; i < Q; ++i )
    cout << fixed << setprecision( 12 ) << ans[ K[ i ] ] << endl;
}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}