#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

LL n, s[2000], dp[2001][2][2][2][2], MOD = 1e9 + 7;

LL f(int c, int d, int e, int v) {
	if(
		(c == 0 && d == 0 && e == 0) || 
		(c == 1 && d == 1 && e == 1) || 
		(c == 1 && d == 0 && e == 0)
	) { return (v == 0 ? 1 : 0); } else { return (v == 1 ? 1 : 0); }
}

int main() {
	cin >> n;
	inc(i, n) { cin >> s[i]; }
	
	inc(a, 2) {
	inc(b, 2) {
		dp[0][a][b][a][b] = 1;
	}
	}
	inc(i, n) {
		inc(a, 2) {
		inc(b, 2) {
		inc(c, 2) {
		inc(d, 2) {
		inc(e, 2) {
			(dp[i + 1][a][b][d][e] += dp[i][a][b][c][d] * f(c, d, e, s[i])) %= MOD;
		}
		}
		}
		}
		}
	}
	
	LL ans = 0;
	inc(a, 2) {
	inc(b, 2) {
		ans += dp[n][a][b][a][b];
	}
	}
	ans %= MOD;
	
	cout << ans << endl;
	
	return 0;
}