//#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 512345, MOD = 1e9 + 7;
pair <int, int> seg[4*MAXN];
int mult[4 * MAXN];
int x[MAXN], y[MAXN];
set <int> s;
set <int> :: iterator it;
int n;
void build(int cur, int ini, int fim) {
if(ini == fim) {
seg[cur] = make_pair(y[ini], ini);
return;
}
int m = (ini + fim) / 2;
int e = 2 * cur, d = 2 * cur + 1;
build(e, ini, m); build(d, m + 1, fim);
seg[cur] = max(seg[e], seg[d]);
}
void buildm(int cur, int ini, int fim) {
if(ini == fim) {
mult[cur] = x[ini];
return;
}
int m = (ini + fim) / 2;
int e = 2 * cur, d = 2* cur + 1;
buildm(e, ini, m); build(d, m + 1, fim);
mult[cur] = ((long long) mult[e] * mult[d]) % MOD;
}
void updatem(int cur, int ini, int fim, int id, int val) {
if(ini > id || fim < id) return;
if(ini == fim) {
mult[cur] = val;
return;
}
int m = (ini + fim) / 2;
int e = 2 * cur, d = 2 * cur + 1;
updatem(e, ini, m, id, val); updatem(d, m + 1, fim, id, val);
mult[cur] = ((long long) mult[e] * mult[d]) % MOD;
}
int querym(int cur, int ini, int fim, int a, int b) {
if(ini > b || fim < a) return 1;
if(ini >= a && fim <= b) return mult[cur];
int m = (ini + fim) / 2;
int e = 2 * cur, d = 2 * cur + 1;
return ( (long long) querym(e, ini, m, a, b) * querym(d, m + 1, fim, a, b)) % MOD;
}
void update(int cur, int ini, int fim, int id, int val) {
if(ini > id || fim < id) return;
if(ini == fim) {
seg[cur].second = val;
return;
}
int m = (ini + fim) / 2;
int e = 2 * cur, d= 2 * cur + 1;
update(e, ini, m, id, val); update(d, m + 1, fim, id, val);
seg[cur] = max(seg[e], seg[d]);
}
pair <int, int> query(int cur, int ini, int fim, int a, int b) {
if(ini > b || fim < a) return make_pair(0, 0);
if(ini >= a && fim <= b) return seg[cur];
int m = (ini + fim) / 2;
int e = 2 * cur, d= 2* cur + 1;
return max(query(e, ini, m, a, b), query(d, m + 1, fim, a, b));
}
int acha() {
vector <int> v;
v.push_back(n);
long long at = 1;
if(s.size() == 0) {
return query(1, 0, n- 1, 0, n - 1).first;
}
it = s.end();
while(it != s.begin() && at < MOD) {
it--;
at = at * x[(*it)];
if(at < MOD) v.push_back(*it);
}
at = 1;
long long mx = 1;
int id = -1;
for(int i = v.size() - 1; i > 0; i--) {
at *= x[v[i]];
int a = v[i], b = v[i - 1] - 1;
pair <int, int> ya = query(1, 0, n - 1, a, b);
if(at * ya.first > mx) {
mx = at * ya.first;
id = ya.second;
}
}
return mx % MOD;
}
int init(int N, int X[], int Y[]) {
n = N;
for(int i = 0; i < n; i++) {
x[i] = X[i]; y[i] = Y[i];
if(x[i] > 1) s.insert(i);
}
build(1, 0, n - 1); buildm(1, 0, n - 1);
return acha();
}
int updateX(int pos, int val) {
if(x[pos] == 1 && val != 1) {
s.insert(pos);
updatem(1, 0, n - 1, pos, val);
}
else if(x[pos] != 1 && val == 1) {
s.erase(pos);
updatem(1, 0, n -1, pos, val);
}
return acha();
}
int updateY(int pos, int val) {
y[pos] = val;
update(1, 0, n - 1, pos, val);
return acha();
}
