#include <bits/stdc++.h>
#include "horses.h"
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
int N; vector<ll> X, Y;
int nt = 1;
vector<ll> st;
ll get_range(int l, int r, int k, int x, int y)
{
if (y < l || x > r) return 1;
if (x >= l && y <= r) return st[k];
int c = (x + y) / 2;
return get_range(l, r, k*2, x, c) * get_range(l, r, k*2|1, c+1, y);
}
int get_max()
{
ll res = (X[0] * Y[0]) % mod, cnt = X[0];
int mx_index = 0;
for (int i = 1; i < N; i++)
{
cnt = (cnt * X[i]) % mod;
ll last_mult = Y[mx_index];
ll mult_range = get_range(mx_index + 1, i, 1, 0, nt - 1);
if (mult_range >= last_mult || mult_range * Y[i] >= last_mult)
{
res = (cnt * Y[i]) % mod;
mx_index = i;
}
}
return (int)res;
}
int init(int n, int x[], int y[])
{
N = n;
X.resize(N);
Y.resize(N);
for (int i = 0; i < N; i++)
{
X[i] = x[i];
Y[i] = y[i];
}
while (nt < N) nt <<= 1;
st = vector<ll>(2 * nt, 1);
for (int i = 0; i < N; i++)
st[nt + i] = X[i];
for (int i = nt-1; i >= 1; i--)
st[i] = st[i*2] * st[i*2|1];
return get_max();
}
int updateX(int pos, int val)
{
X[pos] = val;
pos += nt;
st[pos] = val;
for (pos /= 2; pos >= 1; pos /= 2)
st[pos] = st[pos*2] * st[pos*2|1];
return get_max();
}
int updateY(int pos, int val)
{
Y[pos] = val;
return get_max();
}
