#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << " " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << " " << j << " " << #i << " " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef pair<pii,pii>pi2;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
void solve(){
int n;
cin >> n;
int arr[n+5];
for(int x=1;x<=n;x++){
cin >> arr[x];
}
arr[0]=INT_MIN;
arr[n+1]=1e15;
int r[n+5];
int l[n+5];
for(int x=1;x<=n;x++){
l[x]=2*arr[x]-arr[x-1];
r[x]=2*arr[x]-arr[x+1];
}
int q;
cin >> q;
for(int x=0;x<q;x++){
int index;
cin >> index;
int cur=0;
int hold=lower_bound(arr,arr+n+2,index)-arr;
if(index-arr[hold-1]<=arr[hold]-index) cur=hold-1;
else cur=hold;
int counter=abs(index-arr[cur]);
bool amos=true;
if(arr[cur]-arr[cur-1]<=arr[cur+1]-arr[cur]) amos=false;
int left=cur;
int right=cur;
//show2(left,left,right,right);
while(left>1&&right<n){
if(amos){
//venture right
int target=arr[left-1];
for(int y=cur+1;y<=n;y++){
right=y;
if(r[y]<=target) break;
}
counter+=abs(arr[left-1]-arr[right]);
counter+=abs(arr[right]-arr[cur]);
cur=left-1;
left--;
amos=false;
}
else{
//venture left
int target=arr[right+1];
for(int y=cur-1;y>=1;y--){
left=y;
if(l[y]>target) break;
}
counter+=abs(arr[left]-arr[right+1]);
counter+=abs(arr[left]-arr[cur]);
cur=right+1;
right++;
amos=true;
}
//show2(left,left,right,right);
//show(counter,counter);
}
//show(cur,cur);
if(left!=1){
counter+=abs(arr[cur]-arr[1]);
}
if(right!=n){
counter+=abs(arr[cur]-arr[n]);
}
cout << counter << "\n";
}
}
/*
10
1 2 3 4 5 6 7 8 9 10
1
2
*/
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
//cin >> t;
while(t--){
solve();
}
}
