#include <bits/stdc++.h>
using namespace std;
#include "horses.h"
//macros
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define INF 1e9
#define pb push_back
#define fi first
#define se second
#define sz size()
const int MX = 5e5+10;
const int MOD = 1e9+7;
ll n, x[MX], y[MX];
ll seg[MX*2];
void buildSeg() {
RE(i,n) seg[i+n] = x[i];
REV(i,1,n) seg[i] = (seg[i*2]*seg[i*2+1])%MOD;
}
void setSeg(int i, ll v) {
for(seg[i+=n]=v; i>1; i/=2) seg[i/2] = (seg[i]*seg[i^1])%MOD;
}
ll getSeg(int l, int r) {
ll res = 1;
for(l+=n, r+=n; l<r; l/=2, r/=2) {
if(l&1) res = (res*seg[l++])%MOD;
if(r&1) res = (res*seg[--r])%MOD;
}
return res;
}
int getAns() {
ll bst = 1;
int i=n-1;
while(i >= 0) {
bst = max(bst, y[i]);
bst *= x[i];
i--;
if(bst >= INF) {
break;
}
}
bst %= MOD;
bst = (bst*getSeg(0,i+1))%MOD;
return bst;
}
int init(int N, int X[], int Y[]) {
n=N;
RE(i,n) x[i]=X[i];
RE(i,n) y[i]=Y[i];
buildSeg();
return getAns();
}
int updateX(int pos, int val) {
x[pos] = val;
setSeg(pos, val);
return getAns();
}
int updateY(int pos, int val) {
y[pos] = val;
return getAns();
}
