#include <bits/stdc++.h>
#define ll long long
#define vc vector
using namespace std;
const ll mn=500100, mod=1000000007;
ll x[mn], y[mn], n;
ll tpro[2 * mn];
ll tmax[2 * mn];
set<ll> act;
ll my[mn];
void updpro(ll pos, ll val){
for (tpro[pos += mn]=val; pos > 1; pos >>= 1) tpro[pos>>1]=(tpro[pos] * tpro[pos^1])%mod;
}
void updmax(ll pos, ll val){
for (tmax[pos += mn]=val; pos > 1; pos >>= 1) tmax[pos>>1]=max(tmax[pos], tmax[pos^1]);
}
ll getpro(ll l, ll r){
ll ret=1;
for(l+=mn, r+=mn;l<r;l>>=1, r>>=1){
if(l&1) ret*=tpro[l++], ret%=mod;
if(r&1) ret*=tpro[--r], ret%=mod;
}
return ret;
}
ll getmax(ll l, ll r){
ll ret=0;
for(l+=mn, r+=mn;l<r;l>>=1, r>>=1){
if(l&1) ret=max(ret, tmax[l++]);
if(r&1) ret=max(ret, tmax[--r]);
}
return ret;
}
void getmy(ll pos){
ll l=pos, r;
auto pr=act.upper_bound(pos);
if(pr==act.end()) r=n;
else r=(*pr);
my[pos]=getmax(l, r);
}
ll getyear(ll pos){ return (getpro(0, pos+1) * my[pos])%mod; }
ll getans(){
vc<ll> preglej;
auto poi = act.end();
for(ll i=0;i<min((ll)100, (ll)act.size());++i){
--poi;
preglej.push_back(*poi);
}
reverse(preglej.begin(), preglej.end());
ll best=0, cur=1;
for(ll i=1;i<preglej.size();++i){
cur*=x[preglej[i]];
if(my[preglej[best]]<cur or my[preglej[best]]<cur * my[preglej[i]]) best=i, cur=1;
}
ll ret=getyear(preglej[best]);
return ret;
}
int updateX(int pos, int val){
if(x[pos]>1 or pos==0) act.erase(pos);
x[pos]=val;updpro(pos, val);
if(x[pos]>1 or pos==0) act.insert(pos);
auto zau = act.upper_bound(pos); --zau;
getmy(*zau);
if(zau!=act.begin()){--zau; getmy(*zau);}
return getans();
}
int updateY(int pos, int val){
y[pos]=val;updmax(pos, val);
auto poi=act.upper_bound(pos);--poi;
getmy(*poi);
return getans();
}
int init(int N, int X[], int Y[]){
n=N;for(ll i=0;i<n;++i) x[i]=X[i], y[i]=Y[i];
for(ll i=0;i<n;++i) updpro(i, X[i]), updmax(i, Y[i]);
for(ll i=0;i<n;++i) if(x[i]>1 or i==0) act.insert(i);
for(ll i=0;i<n;++i) if(x[i]>1 or i==0) getmy(i);
return getans();
}
