#pragma GCC optimize(2)

#pragma GCC optimize(3)

#pragma GCC optimize(4)

#include<bits/stdc++.h>

using namespace std;

#define y1 y11

#define fi first

#define se second

#define pi acos(-1.0)

#define LL long long

//#define mp make_pair

#define pb push_back

#define ls rt<<1, l, m

#define rs rt<<1|1, m+1, r

#define ULL unsigned LL

#define pll pair<LL, LL>

#define pli pair<LL, int>

#define pii pair<int, int>

#define piii pair<pii, int>

#define pdd pair<double, double>

#define mem(a, b) memset(a, b, sizeof(a))

#define debug(x) cerr << #x << " = " << x << "\n";

#define fio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

//head

const int N = 2e5 + ;

LL dp[N][];

int a[N];

int main() {

    int n;

    scanf("%d", &n);

    for (int i = ; i <= n; ++i) scanf("%d", &a[i]);

    for (int i = ; i <= n; i++) {

        dp[i][] = dp[i-][] + a[i];

        for (int j = ; j < ; j++) {

            dp[i][j] = dp[i-][j];

            for (int k = ; k < j; k++) dp[i][j] = min(dp[i][j], dp[i-][k]);

        }

        dp[i][] += a[i] ==  ?  : (a[i]% != );

        dp[i][] += a[i]% != ;

        dp[i][] += a[i] ==  ?  : (a[i]% != );

        dp[i][] += a[i];

    }

    LL ans = dp[n][];

    for (int i = ; i < ; i++) ans = min(ans, dp[n][i]);

    printf("%lld\n", ans);

    return ;

}