#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <functional>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cassert>
using namespace std;

#define EPS 1e-12
#define ull unsigned long long
#define ll long long
#define VI vector<ll>
#define PII pair<ll, ll> 
#define VVI vector<vector<ll> >
#define REP(i,n) for(int i=0,_n=(n);(i)<(int)_n;++i)
#define RANGE(i,a,b) for(int i=(int)a,_b=(int)(b);(i)<_b;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define PB push_back
#define MP(a, b) make_pair(a, b)
#define POPCOUNT __builtin_popcount
#define POPCOUNTLL __builtin_popcountll
#define CLEAR(table, v) memset(table, v, sizeof(table));
#define PRINT1(table, D0) REP(d0, D0) cout<<table[d0]<<" "; cout<<"\n";
#define PRINT2(table, D0, D1) REP(d0, D0) { REP(d1, D1) cout<<table[d0][d1]<<" "; cout<<"\n"; }
#define PRINT3(table, D0, D1, D2) REP(d0, D0) { REP(d1, D1) { REP(d2, D2) cout<<table[d0][d1][d2]<<" "; cout<<"\n"; } cout<<"\n"; }
#define UNIFORM_DOUBLE(a, b) (((b-a)*(double)rand()/RAND_MAX)+a) // [a, b) 
#define UNIFORM_LL(a, b) (ll)UNIFORM_DOUBLE(a, b) // [a, b) 
#define IN(v, lo, hi) ((lo)<=(v) && (v)<(hi))
#define DD(v) cout<<#v<<": "<<v<<endl
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const map<T0, T1>& v) { for( typename map<T0, T1>::const_iterator p = v.begin(); p!=v.end(); p++ ){os << p->first << ": " << p->second << " ";} return os; }
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const pair<T0, T1>& v) { os << v.first << ": " << v.second << " "; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << " "; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<vector<T> >& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << endl; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const set<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const deque<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }

#define MOD 1000000007LL
#define INF (1LL<<60)
/*
L,S,E,H in [0, N]
[1, L] 0
(L, S] even, >0
(S, E] odd, >0
(E, H] even, >0
(H, N] 0
*/
ll score(ll v, ll t) {
	if(t==0||t==4) return v;
	if(t==1||t==3) {
		if(v==0) return 2;
		return v&1;
	}
	return v&1 ? 0 : 1;
}
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll N;
	while(cin>>N) {
		VI A(N);
		REP(i, N) cin>>A[i];
		VVI dp(N+1, VI(5, INF));
		REP(i, 5) dp[0][i] = 0;
		RANGE(i, 1, N+1) {
			REP(j, 5) {
				if(j) dp[i-1][j]=min(dp[i-1][j], dp[i-1][j-1]);
				dp[i][j] = dp[i-1][j] + score(A[i-1], j);
			}
//			// 0->0
//			dp[i][0] = dp[i-1][0] + score(A[i-1], 0);
//			// 0,1->1
//			dp[i][1] = *min_element(&dp[i-1][0], &dp[i-1][2]) + score(A[i-1], 1);
//			// 0,1,2->2
//			dp[i][2] = *min_element(&dp[i-1][0], &dp[i-1][3]) + score(A[i-1], 2);
//			// 0,1,2,3->3
//			dp[i][3] = *min_element(&dp[i-1][0], &dp[i-1][4]) + score(A[i-1], 3);
//			// 0,1,2,3,4->4
//			dp[i][4] = *min_element(&dp[i-1][0], &dp[i-1][5]) + score(A[i-1], 4);
		}
		ll ans = *min_element(ALL(dp[N]));
		cout<<ans<<endl;
	}
	
	return 0;
}


Measured memory_bytes: 15872