#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

int N;
int A[100];

int main(int argc, char **argv) {
	cin >> N;
	CLEAR(A);
	int s = 0;
	REP(i, N) cin >> A[i];
	REP(i, N) s += A[i];
	int res = 10000000;
	REP(i, 100) {
		int cnt[2] = { 0, 0 };
		REP(j, 100) {
			int c = max(0, 1 + i - abs(i - j));
			if (c > A[j]) cnt[0] += c - A[j];
			else cnt[1] += A[j] - c;
		}
		if (cnt[0] <= cnt[1]) res = min(res, cnt[1]);
	}
	cout << res << endl;
	return 0;
}