//  ↘ ⬇ ⬇ ⬇ ⬇ ⬇ ↙
//  ➡ @roadfromroi ⬅
//  ↗ ⬆ ⬆ ⬆ ⬆ ⬆ ↖
#include <iostream>
#include "vector"
#include "algorithm"
#include "numeric"
#include "climits"
#include "iomanip"
#include "bitset"
#include "cmath"
#include "map"
#include "deque"
#include "array"
#include "set"
#include "horses.h"
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
struct segtree {
    int sz;
    vector<int> tree;
    void init(int n, vector<int> a) {
        sz = 1;
        while (sz < n)
            sz *= 2;
        tree.assign(sz * 2, {});
        for (int i = 0; i < n; ++i) {
            tree[i + sz] = a[i];
        }
        for (int i = sz - 1; i > 0; --i) {
            tree[i] = max(tree[i * 2], tree[i * 2 + 1]);
        }
    }
    int get(int l, int r) {
        l += sz;
        r += sz;
        int res = 0;
        while (l <= r) {
            if (l % 2) {
                res = max(res, tree[l]);
                l++;
            }
            if (r % 2 == 0) {
                res = max(res, tree[r]);
                r--;
            }
            l /= 2;
            r /= 2;
        }
        return res;
    }
    void ch(int v, int x) {
        v += sz;
        tree[v] = x;
        while (v != 1) {
            v /= 2;
            tree[v] = max(tree[v * 2], tree[v * 2 + 1]);
        }
    }
};
struct segtreemult {
    int sz;
    vector<ll> tree;
    void init(int n, vector<int> a) {
        sz = 1;
        while (sz < n)
            sz *= 2;
        tree.assign(sz * 2, {});
        for (int i = 0; i < n; ++i) {
            tree[i + sz] = a[i];
        }
        for (int i = sz - 1; i > 0; --i) {
            tree[i] = tree[i * 2] * tree[i * 2 + 1] % mod;
        }
    }
    int get(int l, int r) {
        l += sz;
        r += sz;
        ll res = 1;
        while (l <= r) {
            if (l % 2) {
                res = res * tree[l] % mod;
                l++;
            }
            if (r % 2 == 0) {
                res = res * tree[r] % mod;
                r--;
            }
            l /= 2;
            r /= 2;
        }
        return res;
    }
    void ch(int v, int x) {
        v += sz;
        tree[v] = x;
        while (v != 1) {
            v /= 2;
            tree[v] = tree[v * 2] * tree[v * 2 + 1] % mod;
        }
    }
};
set<int> nonzeroes;
segtree sgmax;
segtreemult sgmult;
vector<int> a, b;
ll getval() {
    ll reba = 1;
    auto it = nonzeroes.end();
    vector<int> elems;
    while (it != nonzeroes.begin()) {
        it--;
        reba *= a[*it];
        elems.push_back(*it);
        if (reba > (int)1e9)
            break;
    }
    if (reba <= (int)1e9 and elems.back() != 0)
        elems.push_back(0);
    ll nst = sgmult.get(0, elems.back());
    reverse(all(elems));
    vector<int> elel(elems.size());
    for (int i = 0; i < elems.size(); ++i) {
        if (i + 1 < elems.size())
            elel[i] = sgmax.get(elems[i], elems[i + 1] - 1);
        else
            elel[i] = sgmax.get(elems[i], (int)a.size() - 1);
    }
    vector<ll> valval(elems.size());
    ll boba = 1;
    for (int i = 0; i < elems.size(); ++i) {
        if (i != 0)
            boba *= a[elems[i]];
        valval[i] = boba * elel[i];
    }
    return (*max_element(all(valval))) % mod * nst % mod;
}
int init(int N, int X[], int Y[]) {
    a.assign(N, 0);
    b.assign(N, 0);
    nonzeroes.clear();
    for (int i = 0; i < N; ++i) {
        a[i] = X[i];
        b[i] = Y[i];
        if (a[i] != 1)
            nonzeroes.insert(i);
    }
    sgmax.init(N, b);
    sgmult.init(N, a);
    return getval();
}
int updateX(int pos, int val) {
    if (a[pos] != 1)
        nonzeroes.erase(pos);
    a[pos] = val;
    if (a[pos] != 1)
        nonzeroes.insert(pos);
    sgmult.ch(pos,val);
    return getval();
}
int updateY(int pos, int val) {
    sgmax.ch(pos,val);
    return getval();
}