#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
#define REP(a,i,n) for (ll i=a;i<n;i++)
#define ll long long
#define ssize 500'005
const ll MOD = 1e9+7;
int N;
ll X[ssize], Y[ssize];
ll solve() {
ll mx=1, runX=1, lastY=Y[N-1];
bool gtee=0;
for (int i=N-1;i>=0;i--) {
if ((!gtee && runX*lastY>= 1'000'000'000) || gtee) {
gtee=true;
runX = (runX%MOD * X[i])%MOD;
continue;
}
if (runX*lastY < Y[i]) {
runX=1;
lastY = Y[i];
}
runX = runX * X[i];
}
return (runX*lastY)%MOD;
}
ll init(int n, int x[], int y[]) {
N = n;
REP(0,i,n) {
X[i] = x[i];
Y[i] = y[i];
}
return solve();
}
ll updateX(int pos, int val) {
X[pos] = val;
return solve();
}
ll updateY(int pos, int val) {
Y[pos] = val;
return solve();
}
