#include<bits/stdc++.h>
using namespace std;
int a[100005],n;
void find(int x){
    int l=1,r=n;
    int mid;
    if(x>a[n]){
        cout<<a[n]<<endl;
        return;
    }
    if(x<a[1]){
        cout<<a[1]<<endl;
        return;
    }
    while(l<=r){
        if(a[mid]==x){
            cout<<a[mid]<<endl;
            return;
        }
        mid=(l+r)/2;
        if(a[mid]<x){
            l=mid+1;
        }else{
            r=mid-1;
        }
    }
    if(abs(a[l]-x)<abs(a[r]-x)){
        cout<<a[l]<<endl;
        return;
    }else{
        cout<<a[r]<<endl;
        return;
    }
}
int main(){
    
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    int m;
    cin>>m;
    for(int i=1;i<=m;i++){
        int x;
        cin>>x;
        find(x);
    }
    return 0;
}