#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;

int main() {
	int n;

	cin >> n;
	vector<int> a(n, 0);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	vector<int> b(n, 0);

	int ans = 1e9;
	for (int len = 1; len <= n; len += 2) {
		fill(b.begin(), b.end(), 0);
		int i;
		for (i = 0; i < len / 2; i++) {
			b[i] = b[len - 1 - i] = i + 1;
		}
		b[i] = (len + 1) / 2;

		int more = 0;
		int less = 0;

		for (int j = 0; j < n; j++) {
			int diff = a[j] - b[j];

			if (diff > 0) {
				more += diff;
			} else {
				less +=  -diff;
			}

		}
		if (more >= less) {
			ans = min(ans, more);
		}
	}
	cout << ans << endl;
	return 0;
}