/*
author : abushbandit
contest : ---
*/
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define ff first
#define ss second
#define pb push_back
#define rep(i,s,f) for(int i = s;i < f;i++)
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#pragma GCC optimize("Ofast,no-stack-protector,fast-math",3)
template <class type1>
using ordered_multiset = tree <type1, null_type, less_equal <type1>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<pair<int,int>> vii;
typedef pair<int,int> pii;
const ll INF = 1e18;
const ll MOD7 = 1e9 + 7;
const ll MOD9 = 998244353;
const ld PI = acos(-1.0);
const int N = 1e6 + 6;
template <class F, class _S>
bool chmin(F &u, const _S &v){
bool flag = false;
if ( u > v ){
u = v; flag |= true;
}
return flag;
}
template <class F, class _S>
bool chmax(F &u, const _S &v){
bool flag = false;
if ( u < v ){
u = v; flag |= true;
}
return flag;
}
int binpow (int a, int n) {
int res = 1;
while (n) {
if (n & 1)
res *= a;
a *= a;
n >>= 1;
}
return res;
}
void start_file(string file){
freopen((file + ".in").c_str(),"r",stdin);
freopen((file + ".out").c_str(),"w",stdout);
}
void solve() {
int n;
cin >> n;
int a[n];
rep(i,0,n){
cin >> a[i];
}
int q;
cin >> q;
if(q == 1){
int x;
cin >> x;
vector<int> b;
rep(i,0,n){
b.pb(x - a[i]);
}
sort(all(b));
int lstp = INF,lstn = INF,cntp = 0,cntn = 0,sumn = 0,sump = 0;
for(int i = 0;i < b.size();i++){
if(b[i] >= 0){
cntp++;
if(cntp == 1){
lstp = i;
}
} else{
cntn++;
lstn = i;
}
}
int ans = 0,lst = -1,cntnp = 0,cntnn = 0;
while(true){
int mn = INF,t = 0;
if(lstp < INF){
if(chmin(mn,b[lstp] + sump)){
t = 1;
}
}
if(lstn < INF){
if(chmin(mn,-b[lstn] + sumn)){
t = -1;
}
}
if(t == 1){
ans += mn;
sumn += mn;
sump -= mn;
cntnp++;
if(cntnp == cntp){
lstp = INF;
} else{
lstp++;
}
} else if(t == -1){
ans += mn;
sump += mn;
sumn -= mn;
cntnn++;
if(cntnn == cntn){
lstn = INF;
} else{
lstn--;
}
} else{
break;
}
}
cout << ans << "\n";
} else{
}
}
signed main() {
ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
int t = 1;
// cin >> t;
while(t--){
solve();
}
}
