#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    int N;
    cin >> N;

    vector<ll> a(N);
    rep(i, N) cin >> a[i];
    ll ans = 0;
    int L = 0, R = N;
    while(L < R && a[L] == 1){
        L++, ans++;
    }
    while(L < R && a[R-1] == 1){
        R--, ans++;
    }

    if(L == R) {cout << ans << '\n'; return 0;}

    vector<int> ids;
    
    ll now = 1;
    rep2(i, L, R-1){
        now *= a[i];
        if(a[i] > 1) ids.eb(i);
        if(now > inf){
            ll tmp = 1;
            rep2(j, L, R-1){
                tmp *= a[j], tmp %= MOD;
            }
            ans += tmp, ans %= MOD;
            {cout << ans << '\n'; return 0;}
        }
    }

    int K = sz(ids);
    vector<ll> dp(K+1, 0);
    ids.eb(ids.back()+1);
    rep(i, K){
        ll now = a[ids[i]];
        rep2(j, i+1, K){
            chmax(dp[j], dp[i]+now+ids[j]-ids[j-1]-1);
            if(j < K) now *= a[ids[j]];
        }
    }

    ans += dp[K];
    cout << ans%MOD << '\n';
}