#include <bits/stdc++.h>
using namespace std;
long long int power(long long int a, long long int b) {
  long long int res = 1;
  a %= 1000000007;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % 1000000007;
    a = a * a % 1000000007;
  }
  return res;
}
long long int modInverse(long long int a) { return power(a, 1000000007 - 2); }
const int N = 500023;
bool vis[N];
vector<int> adj[N];
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> v;
  for (long long int i = 0; i < n / 2; i++) {
    long long int c;
    cin >> c;
    v.push_back(c);
  }
  sort((v).begin(), (v).end());
  long long int ans1 = 0;
  long long int ans2 = 0;
  int pos = 1;
  for (int i = 0; i < v.size(); i++) {
    ans1 += ((abs(v[i] - pos)));
    pos += 2;
  }
  pos = 2;
  for (int i = 0; i < v.size(); i++) {
    ans2 += ((abs(v[i] - pos)));
    pos += 2;
  }
  cout << min(ans1, ans2);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int T = 1;
  int t = 0;
  while (t++ < T) {
    solve();
  }
  cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
       << "ms\n";
}
