#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main(){
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  int f = 0;
  while (A[f] == 1){
    f++;
    if (f == N){
      break;
    }
  }
  int g = N - 1;
  while (A[g] == 1){
    g--;
    if (g == -1){
      break;
    }
  }
  if (f == N){
    cout << N << endl;
  } else {
    vector<int> B;
    for (int i = f; i <= g; i++){
      B.push_back(A[i]);
    }
    N = B.size();
    long long prod = 1;
    bool big = false;
    for (int i = 0; i < N; i++){
      if ((200000000000000 + B[i] - 1) / B[i] <= prod){
        big = true;
        break;
      } else {
        prod *= B[i];
      }
    }
    if (big){
      long long ans = 1;
      for (int i = 0; i < N; i++){
        ans *= B[i];
        ans %= MOD;
      }
      ans += A.size() - N;
      ans %= MOD;
      cout << ans << endl;
    } else {
      vector<int> po, num;
      for (int i = 0; i < N; i++){
        if (B[i] >= 2){
          po.push_back(i);
          num.push_back(B[i]);
        }
      }
      int m2 = num.size();
      vector<int> one(m2 + 1);
      one[0] = po[0];
      for (int i = 0; i < m2 - 1; i++){
        one[i + 1] = po[i + 1] - po[i] - 1;
      }
      one[m2] = N - po[m2 - 1] - 1;
      vector<vector<long long>> pr(m2 + 1, vector<long long>(m2 + 1, 1));
      for (int i = 0; i < m2; i++){
        for (int j = i + 1; j <= m2; j++){
          for (int k = i; k < j; k++){
            pr[i][j] *= num[k];
          }
        }
      }
      vector<vector<long long>> dp(m2 + 1, vector<long long>(m2 + 1, 0));
      for (int d = 1; d <= m2; d++){
        for (int l = 0; l <= m2 - d; l++){
          int r = l + d;
          dp[l][r] = pr[l][r];
          for (int i = l + 1; i < r; i++){
            dp[l][r] = max(dp[l][r], dp[l][i] + one[i] + dp[i][r]);
          }
        }
      }
      long long ans = dp[0][m2];
      ans += A.size() - N;
      ans %= MOD;
      cout << ans << endl;
    }
  }
}