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

int main() {
    int N,Q; cin>>N;
    vector<int> A(N);
    for(int i=0;i<N;i++){cin>>A[i];}
    cin>>Q;
    vector<int> B(Q);
    for(int i=0;i<Q;i++){cin>>B[i];}
    
    sort(A.begin(),A.end());
    for(int i=0;i<Q;i++){
        auto it = lower_bound(A.begin(),A.end(),B[i]);
        int index = it - A.begin();
        if(index==0){
            cout<<abs(A[index]-B[i])<<endl;
        }else if((abs(A[index]-B[i]) < abs(B[i]-A[index-1]))){
            cout<<abs(A[index]-B[i])<<endl;
        }else{
            cout<<abs(B[i]-A[index-1])<<endl;
        }
    }
}