#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (int i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	ll N,M;
	cin>>N;
	M=2*N;
	vector<pair<int,int>> p;
	rep(i,N){
		ll a;
		cin>>a;
		if(a!=1){
			M/=a;
			p.push_back({i,a});
		}
	}
	if(M==0){
		ll ans=1;
		for(auto x:p) ans=(ans*x.second)%mod;
		ans+=p[0].first;
		ans+=N-1;
		ans-=p[(int)(p.size())-1].first;
		ans%=mod;
		cout<<ans<<"\n";
		return ;
	}
	if(p.size()==0){
		cout<<N<<"\n";
		return ;
	}
	int L=p.size();
	vector<int> dp(L);
	int ans=0;
	rep(i,L){
		int tmp=p[i].second;
		for(int j=i+1;j<L;j++){
			chmax(dp[j],tmp+dp[i]+p[j].first-p[j-1].first-1);
			tmp*=p[j].second;
		}
		chmax(ans,tmp+dp[i]);
	}
	ans+=p[0].first;
	ans+=N-1;
	ans-=p[L-1].first;
	cout<<ans%mod<<"\n";
}