#include <bits/stdc++.h>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

using i64 = long long;

const i64 inf = 1e18;

const int N = 2e5 + 10;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

int n;
i64 a[N];

int main() {
  n = read();
  rep(i, 1, n) a[i] = read();
  a[0] = -inf, a[n + 1] = inf;
  for (int q = read(); q; -- q) {
    i64 s = read(), ans = 0;
    int l = upper_bound(a + 1, a + n + 1, s) - a - 1, r = l + 1;
    while (l >= 1 || r <= n) {
      if (s - a[l] <= a[r] - s) {
        int i = lower_bound(a + 1, a + n + 1, 2 * s - a[r]) - a;
        ans += s - a[i], s = a[i], l = i - 1;
      }
      else {
        int i = upper_bound(a + 1, a + n + 1, 2 * s - a[l]) - a - 1;
        ans += a[i] - s, s = a[i], r = i + 1;
      }
    }
    printf("%lld\n", ans);
  }
  return 0;
}