#line 1 "a.cpp"
#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
#line 2 "/home/kotatsugame/library/math/modint.cpp"
#include<iostream>
#include<utility>
template<int m>
struct modint{
	unsigned int x;
	constexpr modint()noexcept:x(){}
	template<typename T>
	constexpr modint(T x_)noexcept:x((x_%=m)<0?x_+m:x_){}
	constexpr unsigned int val()const noexcept{return x;}
	constexpr modint&operator++()noexcept{if(++x==m)x=0;return*this;}
	constexpr modint&operator--()noexcept{if(x==0)x=m;--x;return*this;}
	constexpr modint operator++(int)noexcept{modint res=*this;++*this;return res;}
	constexpr modint operator--(int)noexcept{modint res=*this;--*this;return res;}
	constexpr modint&operator+=(const modint&a)noexcept{x+=a.x;if(x>=m)x-=m;return*this;}
	constexpr modint&operator-=(const modint&a)noexcept{if(x<a.x)x+=m;x-=a.x;return*this;}
	constexpr modint&operator*=(const modint&a)noexcept{x=(unsigned long long)x*a.x%m;return*this;}
	constexpr modint&operator/=(const modint&a)noexcept{return*this*=a.inv();}
	constexpr modint operator+()const noexcept{return*this;}
	constexpr modint operator-()const noexcept{return modint()-*this;}
	constexpr modint pow(long long n)const noexcept
	{
		if(n<0)return pow(-n).inv();
		modint x=*this,r=1;
		for(;n;x*=x,n>>=1)if(n&1)r*=x;
		return r;
	}
	constexpr modint inv()const noexcept
	{
		int s=x,t=m,x=1,u=0;
		while(t)
		{
			int k=s/t;
			s-=k*t;
			swap(s,t);
			x-=k*u;
			swap(x,u);
		}
		return modint(x);
	}
	friend constexpr modint operator+(const modint&a,const modint&b){return modint(a)+=b;}
	friend constexpr modint operator-(const modint&a,const modint&b){return modint(a)-=b;}
	friend constexpr modint operator*(const modint&a,const modint&b){return modint(a)*=b;}
	friend constexpr modint operator/(const modint&a,const modint&b){return modint(a)/=b;}
	friend constexpr bool operator==(const modint&a,const modint&b){return a.x==b.x;}
	friend constexpr bool operator!=(const modint&a,const modint&b){return a.x!=b.x;}
	friend ostream&operator<<(ostream&os,const modint&a){return os<<a.x;}
	friend istream&operator>>(istream&is,modint&a){long long v;is>>v;a=modint(v);return is;}
};
#line 7 "a.cpp"
using mint=modint<(int)1e9+7>;
int N;
int A[2<<17];
mint rec(int L,int R)
{
	int sum=(R-L)*2;
	long prod=1;
	for(int i=L;i<R;i++)
	{
		prod*=A[i];
		if(prod>=sum)prod=sum;
	}
	if(prod>=sum)
	{
		mint ret=1;
		for(int i=L;i<R;i++)
		{
			ret*=A[i];
		}
		return ret;
	}
	vector<pair<int,pair<int,int> > >B;
	for(int i=L;i<R;)
	{
		if(A[i]==1)
		{
			int j=i;
			while(j<R&&A[j]==1)j++;
			B.push_back(make_pair(-(j-i),make_pair(i,j)));
			i=j;
		}
		else
		{
			int j=i;
			int prod=1;
			while(j<R&&A[j]!=1)prod*=A[j++];
			B.push_back(make_pair(prod,make_pair(i,j)));
			i=j;
		}
	}
	int n=B.size()-1;
	int ans=-1,ansbit;
	for(int bit=0;bit<1<<n;bit++)
	{
		int now=B[0].first;
		int sum=0;
		for(int i=0;i<n;i++)
		{
			if(bit>>i&1)
			{
				if(now<0)now=1;
				if(B[i+1].first>0)now*=B[i+1].first;
			}
			else
			{
				sum+=abs(now);
				now=B[i+1].first;
			}
		}
		sum+=abs(now);
		if(ans<sum)
		{
			ans=sum;
			ansbit=bit;
		}
	}
	mint ret=0;
	int now=B[0].first;
	for(int i=0;i<n;i++)
	{
		if(ansbit>>i&1)
		{
			if(now<0)now=1;
			if(B[i+1].first>0)now*=B[i+1].first;
		}
		else
		{
			ret+=abs(now);
			now=B[i+1].first;
		}
	}
	ret+=abs(now);
	return ret;
}
mint func(int L,int R)
{
	mint ret=0;
	while(L<R&&A[L]==1)
	{
		ret++;
		L++;
	}
	if(L==R)return ret;
	int r=R;
	while(A[r-1]==1)
	{
		ret++;
		r--;
	}
	ret+=rec(L,r);
	return ret;
}
main()
{
	scanf("%d",&N);
	for(int i=0;i<N;i++)scanf("%d",&A[i]);
	printf("%u\n",func(0,N).val());
}