#include <bits/stdc++.h>

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

    int n;
    std::cin >> n;
    std::vector<int> input(n);
    for (auto& i : input) {
        std::cin >> i;
    }

    int q;
    std::cin >> q;
    for (int i = 0; i < q; i++) {
        int x;
        std::cin >> x;
        int64_t ans = 0;
        {
            int it = std::lower_bound(input.begin(), input.end(), x) - input.begin();
            std::pair<int, int> min(1.1e9, -1);
            if (it != n) {
                min = std::min(min, {abs(input[it] - x), it});
            }
            if (it > 0) {
                min = std::min(min, {abs(input[it - 1] - x), it - 1});
            }
            ans += min.first;
            x = min.second;
        }
        int it1 = x - 1;
        int it2 = x + 1;

        while (it1 != -1 && it2 != n) {
            auto min = std::min<std::pair<int, int>>({input[x] - input[it1], it1}, {input[it2] - input[x], it2});
            ans += min.first;
            if (min.second == it1) {
                x = it1--;
            } else {
                x = it2++;
            }
        }

        if (it1 != -1) {
            ans += abs(input[0] - input[x]);
        }
        if (it2 != n) {
            ans += abs(input[n - 1] - input[x]);
        }

        std::cout << ans << "\n";
    }

    return 0;
}