#include<bits/stdc++.h>
using namespace std;

#define int64_t int
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

vector<pii> G[200009];
int dis[200009];
int tab[200009];
map<int, int> M;

void dfs(int x) {
	for(pii y:G[x]) {
		dis[y.st] = dis[x]+y.nd;
		dfs(y.st);
	}
}

int d(int x, int y) {
	return abs(tab[x]-tab[y]);
}

int32_t main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n;
	cin >> n;
	for(int i=0;i<n;i++) { 
		cin >> tab[i];
		M[tab[i]] = i;
	}
	for(int i=1;i<n-1;i++) {
		if(d(i-1, i)<=d(i, i+1)) {
			int target = i-1;
			while(target-1>=0&&d(target-1, target)<=d(target,i+1)) target--;
			G[target].pb({i, d(target, i)});
			//cerr << "edge: " << i << " -> " << target << "\n";
		} else {
			int target = i+1;
			while(target+1<n&&d(target+1, target)<d(target,i-1)) target++;
			G[target].pb({i, d(target, i)});
			//cerr << "edge: " << i << " -> " << target << "\n";
		}
	}
	dfs(0);
	dfs(n-1);

	int q;
	cin >> q;
	while(q--) {
		int x;
		cin >> x;
		auto it = M.upper_bound(x);
		int y1 = (*it).nd;
		it--;
		int y2 = (*it).nd;
		if(abs(tab[y1]-x)<=abs(tab[y2]-x)) {
			cout << abs(tab[y1]-x)+d(0, n-1)+dis[y1];
		} else {
			cout << abs(tab[y2]-x)+d(0, n-1)+dis[y2];
		}
		cout << "\n";
	}
}