#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

constexpr int N = 2e5;
int a[N+9];
int d[N+9];
int maks[N+9][25];

int mnp(int l, int r){
    int dlug = r-l+1;
    int pot = 31-__builtin_clz(dlug);
    return max(maks[l][pot],maks[r-(1<<pot)+1][pot]);
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,q,b;
    cin >> n;
    a[0] = -1e9+9;
    d[0] = 1e9+9;
    for (int x=1;x<=n;x++){
        cin >> a[x];
        d[x] = a[x]-a[x-1];
    }
    d[n+1] = 1e9+9;
    for (int x=0;x<=n+1;x++){
        maks[x][0] = d[x];
    }
    for (int k=1;k<19;k++){
        for (int x=0;x<=n+1;x++){
            maks[x][k] = max(maks[x][k-1],maks[min(n,x+(1<<k)-1)][k-1]);
        }
    }
    cin >> q;
    while(q--){
        cin >> b;
        int pocz,kon,srod;
        pocz = 1;
        kon = n;
        while(pocz<kon){
            srod = (pocz+kon+1)/2;
            if (a[srod]<=b) pocz = srod;
            else kon = srod-1;
        }
        int l,r,kier;
        if (abs(b-a[pocz]) < abs(b-a[pocz+1])){
            l = pocz;
            r = pocz;
        }
        else{
            l = pocz+1;
            r = pocz+1;
        }
        if (abs(b-a[l-1]) < abs(b-a[l+1])){
            kier = 0;
        }
        else{
            kier = 1;
        }
        ll odp = 0LL;
        while(l>1 || r<n){
            if (kier==0){
                int aa = d[r+1];
                if (mnp(1,l) < aa){
                    odp += a[r] - a[1];
                    l = 1;
                    kier = 1;
                    continue;
                }
                pocz = 1;
                kon = l-1;
                while(pocz<kon){
                    srod = (pocz+kon+1)/2;
                    if (mnp(srod,l) < aa) kon = srod-1;
                    else pocz = srod;
                }
                odp += a[r]-a[pocz];
                l = pocz;
                kier = 1;
            }
            else{
                int aa = d[l];
                if (mnp(r+1,n) < aa){
                    odp += a[n] - a[l];
                    r = n;
                    kier = 0;
                    continue;
                }
                pocz = r+1;
                kon = n;
                while(pocz<kon){
                    srod = (pocz+kon)/2;
                    if (mnp(r+1,srod) < aa) pocz = srod+1;
                    else kon = srod;
                }
                odp += a[pocz]-a[l];
                r = pocz;
                kier = 0;
            }
        }
        cout << odp << '\n';
    }
    return 0;
}