#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int maxn = 5e5 + 50;
const int mod = 1e9+7;
ld lgx[maxn],lgy[maxn],seg2[(1<<20)];
ll seg[(1<<20)],y[maxn],x[maxn];
int best[(1<<20)];
int n,l,r;
ld getsum(int n,int s,int e){
if(s > r || e < l)return 0;
if(s >= l && e <= r){
return seg2[n];
}
return getsum(n*2,s,(s+e)/2) + getsum(n*2+1,(s+e)/2+1,e);
}
void build1(int n,int s,int e){
if(s == e){
seg[n] = x[s];
seg2[n] = lgx[s];
return;
}
build1(n*2,s,(s+e)/2);
build1(n*2+1,(s+e)/2+1,e);
seg[n] = (seg[n*2] * seg[n*2+1])%mod;
seg2[n] = seg2[n*2] + seg2[n*2+1];
}
void build2(int n,int s,int e){
if(s == e){
best[n] = s;
return;
}
build2(n*2,s,(s+e)/2);
build2(n*2+1,(s+e)/2+1,e);
l = 1;r = best[n*2];
ld v = getsum(1,1,::n);
ld left = v + lgy[r];
r = best[n*2+1];
v = getsum(1,1,::n);
ld right = v + lgy[r];
if(left >= right)best[n] = best[n*2];
else best[n] = best[n*2+1];
}
void update1(int n,int s,int e){
if(s > r || e < l)return;
if(s == e){
seg[n] = x[s];
seg2[n] = lgx[s];
return;
}
update1(n*2,s,(s+e)/2);
update1(n*2+1,(s+e)/2+1,e);
seg[n] = (seg[n*2] * seg[n*2+1])%mod;
seg2[n] = (seg2[n*2] + seg2[n*2+1]);
}
void update2(int n,int s,int e){
if(s > r || e < l)return;
if(s == e){
best[n] = s;
return;
}
update2(n*2,s,(s+e)/2);
update2(n*2+1,(s+e)/2+1,e);
l = 1;r = best[n*2];
ld left = getsum(1,1,::n) + lgy[r];
r = best[n*2+1];
ld right = getsum(1,1,::n) + lgy[r];
if(left >= right)best[n] = best[n*2];
else best[n] = best[n*2+1];
}
ll get(int n,int s,int e){
if(s > r || e < l)return 1;
if(s >= l && e <= r)return seg[n];
return (get(n*2,s,(s+e)/2) * get(n*2+1,(s+e)/2+1,e))%mod;
}
int solve(){
l = 1;
r = best[1];
return (get(1,1,n) * y[r])%mod;
}
int init(int N, int X[], int Y[]){
n = N;
for(int i=1;i<=n;i++){
y[i] = Y[i-1];
x[i] = X[i-1];
lgx[i] = log(x[i]);
lgy[i] = log(y[i]);
}
build1(1,1,n);
build2(1,1,n);
return solve();
}
int updateX(int pos, int val) {
pos++;
x[pos] = val;
lgx[pos] = log(x[pos]);
l = r = pos;
update1(1,1,n);
update2(1,1,n);
return solve();
}
int updateY(int pos, int val) {
pos++;
y[pos] = val;
lgy[pos] = log(y[pos]);
l = r = pos;
update2(1,1,n);
return solve();
}
