#include #include #include using namespace std; using namespace atcoder; using mint = modint998244353; #define rep(i,n) for (int i = 0; i < (n); ++i) #define Inf 1000000000 int main() { int N; cin>>N; vector a(N); vector pos(2,vector()); rep(i,N){ cin>>a[i]; if(a[i]<=N/2)pos[0].push_back(i); else pos[1].push_back(i); } long long ans = 1000000000000000000; rep(i,2){ if(pos[i].size()==(N+1)/2){ long long sum = 0; for(int j=0;j<=N-1;j+=2){ sum += abs(pos[i][j/2]-j); } ans = min(ans,sum); } } cout<