import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }

    static class Task {
        public void solve(int testNumber, Scanner sc, PrintWriter out) {
            int m = sc.nextInt();
            int n = m / 2;
            int a[] = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = sc.nextInt();
            }
            Arrays.sort(a);
            int ans1 = 0;
            int j = n - 1;
            for (int i = 2 * n; i > 0; i -= 2) {
                ans1 += Math.abs(a[j] - i);
                j--;
            }
            int ans2 = 0;
            j = n - 1;
            for (int i = 2 * n - 1; i > 0; i -= 2) {
                ans2 += Math.abs(a[j] - i);
                j--;
            }
            out.println(Math.min(ans1, ans2));
        }

    }
}

