#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int arr[n];
for(int &i : arr){
cin >> i;
}
///assume ascending
int pref[n];
pref[0]=arr[0];
for(int i = 1;i<n;i++){
pref[i]=pref[i-1]+arr[i];
}
int ans = 1e9;
for(int m = 0;m<n;m++){
///m is included in left group
int lefm = m/2;
int rigm = m+((n-m)/2);
int lefcost = ((pref[m]-pref[lefm])-(m-lefm)*arr[lefm])+((lefm+1)*arr[lefm]-pref[lefm]);
int rigcost = ((pref[n-1]-pref[rigm])-(n-1-rigm)*arr[rigm])+((arr[rigm]*(rigm-m))-(pref[rigm]-pref[m]));
ans=min(lefcost+rigcost,ans);
}
cout << ans;
return 0;
}
