#include <cstdio> 
#include <stack> 

using namespace std; 

typedef long long ll;

const int N = 1e5 + 10; 
const ll OO = 1e18;

int n, A[N]; 

stack<int> L, R; 

int main() {
	scanf("%d", &n);
	for(int i = 0; i < n; ++i) scanf("%d", A + i); 
	int q, x; scanf("%d%d", &q, &x);

	int lo = -1, hi = n;
	for(; hi - lo > 1; ) {
		int mi = (lo + hi) / 2;
		if(A[mi] <= x) lo = mi;
		else hi = mi;
	}

	for(int i = 0; i <= lo; ++i) L.push(A[i]);
	for(int i = n - 1; i >= hi; --i) R.push(A[i]); 

	ll ans = 0;
	for(; !L.empty() || !R.empty(); ) {
		ll l = L.empty() ? OO : x - L.top(); 
		ll r = R.empty() ? OO : R.top() - x;
		if(l <= r) {
			ans += x - L.top(); 
			x = L.top(); 
			L.pop();
		} else {
			ans += R.top() - x;
			x = R.top();
			R.pop();
		}
	}

	printf("%lld\n", ans);
	return 0;
}