#include<algorithm>
#include<cassert>
#include<iostream>
#include<vector>
using namespace std;
typedef long long lint;
typedef vector<int>vi;
typedef vector<lint>vl;
typedef pair<int,int>pii;
#define rep(i,n)for(int i=0;i<(int)(n);++i)

const lint mod=1e9+7;
lint cmul(lint a,lint b){
  a=min(a,mod);
  b=min(b,mod);
  return min(a*b,mod);
}

int n;
vl a;
vl o,num,numcap;
const lint lim=2.5e5,blim=18;
bool dp[blim+1][lim];
int main(){
  cin>>n;
  a.resize(n);
  rep(i,n)cin>>a[i];
  lint sum=0;
  int c1=0;
  lint pr=1,cap=1;
  int ph=0;
  rep(i,n){
    if(a[i]==1){
      if(ph==0){
        c1++;
      }else{
        o.push_back(c1);
        num.push_back(pr);
        numcap.push_back(cap);
        ph=0;
        pr=1;
        cap=1;
        c1=1;
      }
    }else{
      if(ph==0){
        ph=1;
      }
      pr=pr*a[i]%mod;
      cap=cmul(cap,a[i]);
    }
  }
  if(ph==0){
    sum=c1;
  }else{
    o.push_back(c1);
    num.push_back(pr);
    numcap.push_back(cap);
  }
  cerr<<sum<<endl;
  rep(i,o.size()){
    cerr<<" "<<o[i]<<" "<<num[i]<<" ("<<numcap[i]<<")"<<endl;
  }
  lint gpr=1;
  lint gcap=1;
  rep(i,o.size()){
    gpr=gpr*num[i]%mod;
    gcap=cmul(gcap,numcap[i]);
  }
  if(gcap>=lim/2){
    sum+=o[0];
    cout<<(sum+gpr)%mod<<endl;
    return 0;
  }
  assert(o.size()<=blim);
  dp[0][0]=1;
  for(int i=1;i<=(int)o.size();i++){
    rep(j,i){
      lint locpr=1;
      for(int k=j;k<i;k++)locpr*=num[k];
      rep(k,lim){
        if(!dp[j][k])continue;
        assert(k+locpr+o[j]<lim);
        dp[i][k+locpr+o[j]]=1;
        assert(cmul(k,locpr)<lim);
        dp[i][k*locpr]=1;
      }
    }
  }
  int ma=0;
  rep(i,lim)if(dp[o.size()][i])ma=i;
  cout<<ma+sum<<endl;
}