#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;
ll T[LIM], n;
map<pair<int,int>,ll>mp;
ll solve(int a, int b) {
	if(mp.find({a, b})!=mp.end()) return mp[{a, b}];
	if(abs(a-b)==n-1) mp[{a, b}]=0;
	else if(a<=b) {
		if(a && (b==n-1 || T[b+1]-T[a]>=T[a]-T[a-1])) mp[{a, b}]=solve(a-1, b)+T[a]-T[a-1];
		else mp[{a, b}]=solve(b+1, a)+T[b+1]-T[a];
	} else {
		if(a<n-1 && (!b || T[a]-T[b-1]>T[a+1]-T[a])) mp[{a, b}]=solve(a+1, b)+T[a+1]-T[a];
		else mp[{a, b}]=solve(b-1, a)+T[a]-T[b-1];
	}
	return mp[{a, b}];
}
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> n;
	rep(i, n) cin >> T[i];
	int q;
	cin >> q;
	while(q--) {
		ll x;
		cin >> x;
		if(x<=T[0]) cout << solve(0, 0)+T[0]-x << '\n';
		else if(x>=T[n-1]) cout << solve(n-1, 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;
			}
			cout << min(solve(po, po)+T[po]-x, solve(po-1, po-1)+x-T[po-1]) << '\n';
		}
	}
}