#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

constexpr int N = 2e5 + 10;

int n, q, p[N];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(nullptr), cout.tie(nullptr);
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> p[i];
    cin >> q;
    while (q--) {
        int s; cin >> s;
        int l = lower_bound(p + 1, p + n + 1, s) - p, r = l;
        l--, r += p[r] == s;
        ll ans = 0;
        while (1) {
            if (l < 1) {ans += p[n] - s; break;}
            if (r > n) {ans += s - p[1]; break;}
            if (s - p[l] <= p[r] - s) {
                int u = lower_bound(p + 1, p + n + 1, 2 * s - p[r]) - p;
                ans += s - p[u], s = p[u], l = u - 1;
            } else {
                int u = upper_bound(p + 1, p + n + 1, 2 * s - p[l]) - p - 1;
                ans += p[u] - s, s = p[u], r = u + 1;
            }
        }
        cout << ans << '\n';
    }
    return 0;
}