#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=2e5+7, LG=20;
ll T[LIM], ma[LIM][LG], n;
ll cnt(int l, int r) {
	int p=31-__builtin_clz(r-l+1);
	return max(ma[l][p], ma[r-(1<<p)+1][p]);
}
ll solve(int x) {
	int a=x, b=x;
	ll ans=0;
	while(abs(a-b)<n-1) {
		if(min(a, b)==0 || max(a, b)==n-1) {
			ans+=T[n-1]-T[0];
			break;
		}
		if(a<b) {
			if(cnt(0, a-1)<=T[b+1]-T[a]) {
				ans+=T[a]-T[0];
				a=0;
				continue;
			}
			if(T[b+1]-T[a]<T[a]-T[a-1]) {
				ans+=T[b+1]-T[a];
				++b;
				swap(a, b);
				continue;
			}
			int po=0, ko=a-1;
			while(po<ko) {
				int sr=(po+ko)/2;
				if(cnt(sr, a-1)<=T[b+1]-T[a]) ko=sr; else po=sr+1;
			}
			ans+=T[a]-T[po];
			a=po;
		} else {
			if(cnt(a, n-2)<T[a]-T[b-1]) {
				ans+=T[n-1]-T[a];
				a=n-1;
				continue;
			}
			if(T[a]-T[b-1]<=T[a+1]-T[a]) {
				ans+=T[a]-T[b-1];
				--b;
				swap(a, b);
				continue;
			}
			int po=a, ko=n-2;
			while(po<ko) {
				int sr=(po+ko+1)/2;
				if(cnt(a, sr)<T[a]-T[b-1]) po=sr; else ko=sr-1;
			}
			ans+=T[po+1]-T[a];
			a=po+1;
		}
	}
	return ans;
}
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> n;
	rep(i, n) {
		cin >> T[i];
		if(i) ma[i-1][0]=T[i]-T[i-1];
	}
	for(ll j=1; j<LG; ++j) rep(i, n-1) ma[i][j]=max(ma[i][j-1], ma[min(n-2, (ll)i+(1ll<<(j-1)))][j-1]);
	int q;
	cin >> q;
	while(q--) {
		ll x;
		cin >> x;
		if(x<=T[0]) cout << solve(0)+T[0]-x << '\n';
		else if(x>=T[n-1]) cout << solve(n-1)+x-T[n-1] << '\n';
		else {
			int po=0, ko=n-1;
			while(po<ko) {
				int sr=(po+ko)/2;
				if(T[sr]<x) po=sr+1; else ko=sr;
			}
			if(x-T[po-1]<=T[po]-x) cout << solve(po-1)+x-T[po-1] << '\n';
			else cout << solve(po)+T[po]-x << '\n';
		}
	}
}