#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<typename T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "horses.h"
const ll MOD = 1e9 + 7;
struct SEGTREE {
int n;
VL tree;
SEGTREE(){}
SEGTREE(int sz) {
n = 1;
while (n < sz) n *= 2;
tree = VL(2*n);
}
void upd(int N, int L, int R, int i, int s) {
if (i < L || i > R) return;
if (L == R) {
tree[N] = s;
return;
}
int M = (L + R) / 2;
upd(2*N+1, L, M, i, s);
upd(2*N+2, M+1, R, i, s);
tree[N] = tree[2*N+1] * tree[2*N+2] % MOD;
}
int get(int N, int L, int R, int l, int r) {
if (l <= L && R <= r) return tree[N];
if (R < l || L > r) return 1;
int M = (L + R) / 2;
return 1ll * get(2*N+1, L, M, l, r) * get(2*N+2, M+1, R, l, r) % MOD;
}
void upd(int i, int s) {
upd(0, 0, n-1, i, s);
}
int get(int l, int r) {
return get(0, 0, n-1, l, r);
}
} seg;
int n;
VL a, b;
ll recalc() {
ll leave = n-1;
ll prod = 1;
reprl(i, n-1, 0) {
if (b[i] > prod) {
prod = a[i] * b[i];
leave = i;
} else {
prod = a[i] * prod;
}
if (prod > 1e9) break;
}
return seg.get(0, leave) * b[leave] % MOD;
}
int init(int N, int X[], int Y[]) {
n = N;
a = b = VL(n);
rep(i, n) {
a[i] = X[i];
b[i] = Y[i];
}
seg = SEGTREE(n);
rep(i, n) seg.upd(i, a[i]);
return recalc();
}
int updateX(int pos, int val) {
a[pos] = val;
seg.upd(pos, a[pos]);
return recalc();
}
int updateY(int pos, int val) {
b[pos] = val;
return recalc();
}
