#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define prArr(a) {cerr<<(#a)<<"={";int i=0;for(auto t:(a))cerr<<(i++?", ":"")<<t;cerr<<"}"<<endl;}
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){
  return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
//INSERT ABOVE HERE

template<typename T>
class CumulativeSum{
public:
  Int n;
  vector<T> sum;
  vector<T> A;
  Int added;
  CumulativeSum():n(-1),added(0){}
  CumulativeSum(Int n):n(n), sum(n+1), A(n+1),added(0){}
  CumulativeSum(const vector<T> &B):n(B.size()), sum(n+1), A(n+1),added(0){
    for(Int i=1;i<=n;i++) sum[i] = sum[i-1] + B[i-1];
  }

  void apply(){
    for(Int i=1;i<=n;i++) A[i] = A[i] + A[i-1];
    for(Int i=1;i<=n;i++) A[i] = A[i] + A[i-1];
    for(Int i=1;i<=n;i++) sum[i] = sum[i] + A[i-1];
    added = 0; A.clear(); A.resize(n+1);
  }

  //[l, r)にxを加算
  void add(Int l, Int r, T x){
    added = 1;
    assert(l <= r && 0 <= l && r <= n);
    A[l] = A[l] + x;
    A[r] = A[r] - x;
  }

  //[l, r)の和を得る
  T get(Int l,Int r){
    assert(l<=r && 0<=l && r<=n);
    if(added) apply();
    return sum[r] - sum[l];
  }
};
const Int SIZE = 200010;
Int N;
vector<Int> A;
CumulativeSum <Int> Asum;


Int memL[SIZE], usedL[SIZE];
Int dfsL(Int pos){ //左に行って戻ってくる
  if(pos == 0) return 0;
  if(usedL[pos]++) return memL[pos];

  Int a = Asum.get(0, pos);
  Int b = (A[pos-1]%2) + 2 * (A[pos-1] == 0) + dfsL(pos-1);
  return memL[pos] = min(a, b);
}

Int memR[SIZE], usedR[SIZE];
Int dfsR(Int pos){ //右に行って戻ってくる
  if(pos == N) return 0;
  if(usedR[pos]++) return memR[pos];

  Int a = Asum.get(pos, N);
  Int b = (A[pos]%2) + 2 * (A[pos] == 0) + dfsR(pos+1);
  return memR[pos] = min(a, b);
}

Int mem[SIZE], used[SIZE];
Int dfs(Int pos){//右に行って好きに終わる
  if(pos == N) return 0;
  if(used[pos]++) return mem[pos];
  Int a = dfsR(pos);
  Int b = (A[pos]%2 != 1) + dfs(pos+1);
  return mem[pos] = min(a, b);
}

Int solve(){
  memset(memL, 0, sizeof(memL));
  memset(usedL, 0, sizeof(usedL));
  memset(memR, 0, sizeof(memR));
  memset(usedR, 0, sizeof(usedR));
  memset(mem, 0, sizeof(mem));
  memset(used, 0, sizeof(used));

  Asum = CumulativeSum<Int> (A);

  Int ans = INF;
  for(Int i=0;i<N;i++){
    Int a = dfsL(i);
    Int b = dfs(i);
    Int cost = (a + b);
    Min(ans, cost);
  }
  return ans;
}

signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);
  cin>>N;
  A.resize(N);
  cin>>A;

  Int a = solve();
  reverse(A.begin(), A.end());
  Int b = solve();
  Int ans = min(a, b);
  cout<<ans<<endl;
  return 0;
}


Measured memory_bytes: 23680