#include<bits/stdc++.h>
#include "horses.h"
#define F first
#define S second
#define PB push_back
#define sz(s) (int(s.size()))
#define bit(n, k) (((n)>>(k))&1)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
const int maxn = 1e5 + 10, mod = 1e9 + 7;
set<int> st; // reverse points
int n;
int val[4 * maxn], zr[4 * maxn];
void add(int pos, int x, int l = 0, int r = n, int id = 1){
if(r-l == 1){
val[id] = x;
return;
}
int mid = (l+r) >> 1;
if(pos < mid)
add(pos, x, l, mid, 2*id);
else
add(pos, x, mid, r, 2*id+1);
val[id] = max(val[2*id], val[2*id+1]);
}
int ask(int f, int s, int l = 0, int r = n, int id = 1){
if(f >= s || l >= r || s <= l || r <= f)
return 0;
if(f <= l && r <= s)
return val[id];
int mid = (l+r) >> 1;
return max(ask(f, s, l, mid, 2*id), ask(f, s, mid, r, 2*id+1));
}
void put(int pos, int x, int l = 0, int r = n, int id = 1){
if(r-l == 1){
zr[id] = x;
return;
}
int mid = (l+r) >> 1;
if(pos < mid)
put(pos, x, l, mid, 2*id);
else
put(pos, x, mid, r, 2*id+1);
zr[id] = 1ll * zr[2*id] * zr[2*id+1] % mod;
}
int zar(int pos, int l = 0, int r = n, int id = 1){
if(pos <= l)
return 1;
if(r <= pos)
return zr[id];
int mid = (l + r) >> 1;
return 1ll * zar(pos, l, mid, 2*id) * zar(pos, mid, r, 2*id+1) % mod;
}
int a[maxn], b[maxn];
int calc(){
int bst = 0, lst = n;
for(int x : st){
x*=-1;
bst = max(bst, ask(x + 1, lst));
lst = x;
ll num = 1ll * a[x] * max(b[x], bst);
if(num >= mod){
bst = num % mod;
break;
}
}
return 1ll * bst * zar(lst) % mod;
}
int init(int n, int X[], int Y[]){
::n = n;
for(int i = 0; i < n; i++){
a[i] = X[i], b[i] = Y[i];
if(a[i] != 1)
st.insert(i);
put(i, a[i]), add(i, b[i]);
}
return calc();
}
int updateX(int pos, int val){
if(val != 1)
st.erase(pos);
else
st.insert(pos);
a[pos] = val;
put(pos, val);
return calc();
}
int updateY(int pos, int val){
b[pos] = val;
add(pos, val);
return calc();
}
