#include "horses.h"
#include "bits/stdc++.h"
#define MAXN 500009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<double,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
PII a[MAXN],b[MAXN],s[MAXN<<2];
double par[MAXN],lazy[MAXN<<2];
int n;
void build(int nd,int x,int y){
if(x==y){
s[nd]=mp(par[x]+b[x].ff,x);
return;
}
int mid=(x+y)>>1;
build(nd<<1,x,mid);
build(nd<<1|1,mid+1,y);
s[nd]=max(s[nd<<1],s[nd<<1|1]);
}
void shift(int nd){
double &ret=lazy[nd];
lazy[nd<<1]+=ret;s[nd<<1].ff+=ret;
lazy[nd<<1|1]+=ret;s[nd<<1|1].ff+=ret;
ret=0;
}
void inc(int l,int r,double v,int nd,int x,int y){
if(l>y or x>r)
return;
if(l<=x and y<=r){
s[nd].ff+=v;
lazy[nd]+=v;
return;
}
shift(nd);
int mid=(x+y)>>1;
inc(l,r,v,nd<<1,x,mid);
inc(l,r,v,nd<<1|1,mid+1,y);
s[nd]=max(s[nd<<1],s[nd<<1|1]);
}
int mod(ll x){
return (x%INF);
}
int get(){
int pos=s[1].ss;
int res=b[pos].ss;
for(int i=1;i<=pos;i++)
res=mod(res*a[i].ss);
return res;
}
int init(int N, int X[], int Y[]) {n=N;
for(int i=1;i<=n;i++)
b[i]=mp(log(Y[i-1]),Y[i-1]),a[i]=mp(log(X[i-1]),X[i-1]),par[i]=(a[i].ff+par[i-1]);
build(1,1,n);
return get();
}
int updateX(int pos, int val) {
inc(pos+1,n,log(val)-a[pos+1].ff,1,1,n);
a[pos+1]=mp(log(val),val);
return get();
}
int updateY(int pos, int val) {
inc(pos+1,pos+1,log(val)-b[pos+1].ff,1,1,n);
b[pos+1]=mp(val,log(val));
return get();
}
