#include"horses.h"
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define all(x) x,begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define mad(a,b) a=(a+b)%mod
int N,X[500010],Y[500010];
int solve(){
ll p=N-1,rui=1;
for(int i=N-1;i>=0;i--){
rui*=(ll)X[i];
if(rui>(ll)1e9)break;
p=i;
}
ll ans=0;
rui=1;
for(int i=p;i<N;i++){
chmax(ans,rui*(ll)Y[i]);
if(i+1<N)rui*=X[i+1];
}
ans%=mod;
for(int i=0;i<=p;i++)ans=ans*(ll)X[i]%mod;
return ans;
}
int init(int n,int x[],int y[]){
N=n;
rep(i,N)X[i]=x[i],Y[i]=y[i];
return solve();
}
int updateX(int pos,int val){
X[pos]=val;
return solve();
}
int updateY(int pos,int val){
Y[pos]=val;
return solve();
}/*
int main(){
cin>>N;
rep(i,N)cin>>X[i];
rep(i,N)cin>>Y[i];
N=1000;
rep(i,N)X[i]=1;
rep(i,N)Y[i]=rand()%(ll)1e9+1;
cout<<init(N,X,Y)<<endl;
while(1){
string type; ll pos,val;
cin>>type>>pos>>val;
if(type=="X")cout<<updateX(pos,val)<<endl;
if(type=="Y")cout<<updateY(pos,val)<<endl;
}
}*/
