#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;

const int MM = 1e9 + 7;
const double eps = 1e-8;
const int MAXN = 2e6 + 10;

int n, m;

void prework(){

}

void read(){

}

ll ans;

ll gao(ll x, ll y, ll l, ll r){
	return min(x * l + y, x * r + y);
}

int a[MAXN];

void solve(int casi){
//	cout << "Case #" << casi << ": ";
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	sort(a + 1, a + n + 1);
	ll x = -n, y = 0;
	// |a[i] - x|
	for (int i = 1; i <= n; i++)
		y += a[i];
	ans = gao(x, y, a[1], a[1]);
	for (int i = 2; i <= n; i++){
		// s + a[i-1] - x
		// s + x - a[i-1]
		x += 2;
		y -= 2 * a[i-1];
		ans = min(ans , gao(x, y, a[i-1], a[i]));
	}
	cout << ans << endl;
}

void printans(){

}


int main(){
	std::ios::sync_with_stdio(false);
	prework();
	int T = 1;
//	cin>>T;
	for(int i = 1; i <= T; i++){
		read();
		solve(i);
		printans();
	}
	return 0;
}