#include <bits/stdc++.h>

//#define int long long
#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
int inf=2000000007;
int mod=1000000007;
int mod1=998244353;

const int N=200007,L=18;

int mn[N][L];
int mx[N][L];
int lg[N];

int get_mn(int l,int r)
{
    int k=lg[r-l+1];
    return min(mn[l][k],mn[r-(1<<k)+1][k]);
}
int get_mx(int l,int r)
{
    int k=lg[r-l+1];
    return max(mx[l][k],mx[r-(1<<k)+1][k]);
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    vector<int>a(n+2);
    a[0]=-inf;
    for(int i=1;i<=n;i++) cin>>a[i];
    a[n+1]=inf;
    for(int i=1;i<=n+1;i++)
    {
        mn[i][0]=2*a[i-1]-a[i];
        mx[i][0]=2*a[i]-a[i-1];
    }
    for(int j=1;j<L;j++)
    {
        for(int i=1;i+(1<<j)-1<=n+1;i++)
        {
            mn[i][j]=min(mn[i][j-1],mn[i+(1<<(j-1))][j-1]);
            mx[i][j]=max(mx[i][j-1],mx[i+(1<<(j-1))][j-1]);
        }
    }
    for(int i=2;i<=n+1;i++) lg[i]=lg[i/2]+1;
    int q;
    cin>>q;
    while(q--)
    {
        int x;
        ll ans=0;
        cin>>x;
        int l=lower_bound(all(a),x)-a.begin();
        ans+=min(a[l]-x,x-a[l-1]);
        if(a[l]-x>=x-a[l-1]) l--;
        int r=l;
        bool side=0;
        while(l>1||r<n)
        {
            if(l==1)
            {
                if(side) ans+=a[n]-a[r];
                else ans+=a[n]-a[l];
                break;
            }
            if(r==n)
            {
                if(side) ans+=a[r]-a[1];
                else ans+=a[l]-a[1];
                break;
            }
            if(side)
            {
                int L=r+1,R=n+1,sr,i;
                while(L<=R)
                {
                    sr=(L+R)/2;
                    if(get_mn(r+1,sr)<=a[l-1])
                    {
                        i=sr;
                        R=sr-1;
                    }
                    else L=sr+1;
                }
                ans+=a[i-1]-a[r];
                ans+=a[i-1]-a[l-1];
                r=i-1;
                l--;
            }
            else
            {
                int L=0,R=l-1,sr,i;
                while(L<=R)
                {
                    sr=(L+R)/2;
                    if(get_mx(sr+1,l)>a[r+1])
                    {
                        i=sr;
                        L=sr+1;
                    }
                    else R=sr-1;
                }
                ans+=a[l]-a[i+1];
                ans+=a[r+1]-a[i+1];
                l=i+1;
                r++;
            }
            side^=1;
        }
        cout<<ans<<endl;
    }


    return 0;
}