#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define FOR(i,l,r) for(int i=(l);i<=(r);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define ssize(x) int(x.size())
#ifdef DEBUG
template<class A,class B>auto&operator<<(ostream&o,pair<A,B>p){return o<<'('<<p.first<<", "<<p.second<<')';}
template<class T>auto operator<<(ostream&o,T x)->decltype(x.end(),o){o<<'{';int i=0;for(auto e:x)o<<(", ")+2*!i++<<e;return o<<'}';}
#define debug(x...) cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...);}(x),cerr<<'\n'
#else
#define debug(...) {}
#endif

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin >> n;
	vector<int> t(n);
	REP (i, n)
		cin >> t[i];

	auto find_start = [&](int x) {
		int ind = int(upper_bound(t.begin(), t.end(), x) - t.begin());
		int ret = 0;
		if (ind < n && abs(t[ret] - x) > abs(t[ind] - x))
			ret = ind;
		if (ind && abs(t[ret] - x) >= abs(t[ind - 1] - x))
			ret = ind - 1;
		return ret;
	};

	const int INF = int(1e9);
	auto dist = [&](int p, int q) {
		if (p < 0 || q < 0 || p >= n || q >= n)
			return INF;
		return abs(t[p] - t[q]);
	};

	debug(t);

	vector<int> start_lf(n, -2), start_rg(n, n + 1);
	FOR (i, 1, n - 1)
		FOR (j, i, n - 1)
			if (t[j] - t[i] >= t[i] - t[i - 1]) {
				start_lf[i] = j;
				break;
			}
	debug(start_lf);

	REP (i, n - 1)
		for (int j = i; j >= 0; --j)
			if (t[i] - t[j] > t[i + 1] - t[i]) {
				start_rg[i] = j;
				break;
			}
	debug(start_rg);

	// return 0;

	int q;
	cin >> q;
	REP (xd, q) {
		int x;
		cin >> x;
		int cur = find_start(x);
		LL ans = abs(t[cur] - x);
		int lf = cur, rg = cur;
		int side = dist(cur - 1, cur) <= dist(cur, cur + 1);
		int cnt = 0;
		while (lf || rg < n - 1) {
			++cnt;
			assert(cnt < 100);
			debug(lf, rg, side);
			if (side) {
				// idziemy w lewo
				int poz = 0;
				REP (i, lf)
					if (start_lf[i] > rg + 1)
						poz = i;
				debug(poz);
				ans += dist(lf, poz);
				lf = poz;
				if (rg < n - 1) {
					ans += dist(lf, rg + 1);
					++rg;
					side ^= 1;
				}
			}
			else {
				// idziemy w prawo
				int poz = n - 1;
				FOR (i, rg, n - 1)
					if (start_rg[i] < lf - 1) {
						poz = i;
						break;
					}
				debug(poz);
				ans += dist(rg, poz);
				rg = poz;
				if (lf) {
					ans += dist(rg, lf - 1);
					--lf;
					side ^= 1;
				}
			}
		}
		cout << ans << '\n';
	}
}