#include <bits/stdc++.h>
using namespace std;
#define For(Ti,Ta,Tb) for(auto Ti=(Ta);Ti<=(Tb);++Ti)
#define Dec(Ti,Ta,Tb) for(auto Ti=(Ta);Ti>=(Tb);--Ti)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define range(Tx) begin(Tx),end(Tx)
using ll=long long;
const int N=2e5+5;
int n,q;
ll x[N];
struct SparseTable{
	ll val[20][N];
	template<typename F>
	void build(F f){
		For(i,1,n){
			val[0][i]=f(i);
		}
		For(j,0,18){
			For(i,2<<j,n){
				val[j+1][i]=max(val[j][i-(1<<j)],val[j][i]);
			}
		}
	}
	int next(int i,ll x){
		if(val[0][i]>x) return i;
		Dec(k,18,0){
			int j=i+(1<<k);
			if(j<=n&&val[k][j]<=x){
				i=j;
			}
		}
		return i+1;
	}
	int prev(int i,ll x){
		if(val[0][i]>x) return i;
		Dec(k,18,0){
			int j=i-(1<<k);
			if(j>=1&&val[k][i-1]<=x){
				i=j;
			}
		}
		return i-1;
	}
}st1,st2;
int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n;
	For(i,1,n){
		cin>>x[i];
	}
	x[0]=-1e18;
	x[n+1]=1e18;
	st1.build([](int i){return 2*x[i]-x[i-1];});
	st2.build([](int i){return x[i+1]-2*x[i];});
	cin>>q;
	For($,1,q){
		int s;
		cin>>s;
		int pos=lower_bound(x+1,x+n+1,s)-x;
		if(x[pos]-s>=s-x[pos-1]){
			--pos;
		}
		int l=pos,r=pos,dir=0;
		ll ans=0;
		while(1<l||r<n){
			if(!dir){
				int i=max(1,st1.prev(l,x[r+1]));
				ans+=x[l]-x[i];
				if(r<n){
					ans+=x[r+1]-x[i];
					++r;
				}
				l=i;
			}else{
				int i=min(n,st2.next(r,-x[l-1]-1));
				ans+=x[i]-x[r];
				if(l>1){
					ans+=x[i]-x[l-1];
					--l;
				}
				r=i;
			}
			dir^=1;
		}
		cout<<ans<<'\n';
	}
	return 0;
}