#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>

using namespace std;

#define FOR(x,y) for(int x = 0;x < y;x++)
#define LLI long long int

template<int um> class UF {
public:
    vector<int> par,rank,cnt;
    UF() {par=rank=vector<int>(um,0); cnt=vector<int>(um,1); for(int i=0;i<um;i++) par[i]=i;}
    void reinit() {FOR(i,um) rank[i]=0,cnt[i]=1,par[i]=i;}
    int operator[](int x) {return (par[x]==x)?(x):(par[x] = operator[](par[x]));}
    int count(int x) { return cnt[operator[](x)];}
    int operator()(int x,int y) {
        if((x=operator[](x))==(y=operator[](y))) return x;
        cnt[y]=cnt[x]=cnt[x]+cnt[y];
        if(rank[x]>rank[y]) return par[x]=y;
        rank[x]+=rank[x]==rank[y]; return par[y]=x;
    }
};

int main() {
    int n;
    cin >> n;
    vector<int> data(n);
    int sum = 0;
    FOR(i, n)
    {
        cin >> data[i];
        sum += data[i];
    }
    int maxSize = sqrt(sum) + 1;
    cout << "maxSize:" << maxSize << endl;
    int minOperation = 1000000000;
    for(int i = 1; i < maxSize*2;i += 2)
    {
        if((i/2) * (i/2) > sum)
        {
            continue;
        }
        cout << "i:" << i << endl;
        int middleIndex = i / 2;
        int count = 0;
        for(int x = 0;x < i;x++)
        {
            int height = middleIndex - abs(middleIndex-x) + 1;
            cout << "height:" << height << endl;
            if(x < n)
            {
                count += abs(height - data[x]);
            }
            else
            {
                count += height;
            }
        }
        for(int x = i;x < n;x++)
        {
            count += data[x];
        }
        minOperation = min(minOperation, count);
    }
    cout << minOperation << endl;
    return 0;
}