#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }


int main() {
  ll N; cin >> N;
  ll Y[N]; rep(i,N) cin >> Y[i];

  ll MA = 10001;
  ll dp[N+1][MA] = {}; rep(i,N+1) fill_n(dp[i],MA,LLINF); dp[0][0] = 0;
  rep(i,N) rep(j,MA) {
    if (j==0) dp[i+1][j] = dp[i][j] + Y[i];
    else if (j<=Y[i]) dp[i+1][j] = min(dp[i+1][j-1]-1, dp[i][j]+(Y[i]-j));
    else dp[i+1][j] = min(dp[i+1][j-1]+1, dp[i][j]+(j-Y[i]));
  }
  // rep(i,N+1) debug(dp[i], dp[i]+MA);

  ll result = *min_element(dp[N],dp[N]+MA);
  cout << result << endl;
  return 0;
}