#include "horses.h"

#include <bits/stdc++.h>

constexpr int mod = 1e9 + 7;

int mul(int a, int b) {
    return a * 1ULL * b % mod;
}
int add(int a, int b) {
    return a + b - mod * (a + b >= mod);
}
int power(int b, int e) {
    int r = 1;
    for (; e > 0; e >>= 1) {
        if (e & 1) {
            r = mul(r, b);
        }
        b = mul(b, b);
    }
    return r;
}

constexpr int inf = 1.1e9;
int mul_bd(int a, int b) {
    return std::min<int64_t>(a * 1LL * b, inf);
}

struct Frac {
    int num, den;

    bool operator<(const Frac& other) const {
        return num * 1LL * other.den < other.num * 1LL * den;
    }
};

struct Cum {
    Frac max;
    int dv, pr;

    Cum() : dv(1), pr(1), max{0, 1} { ; }
    Cum(int x, int y) : pr(x), dv(x), max{y, 1} { ; }
};

Cum merge(const Cum& a, const Cum& b) {
    Cum c;
    c.pr = mul(a.pr, b.pr);
    c.dv = mul_bd(a.dv, b.dv);
    c.max = std::max(b.max, Frac(a.max.num, mul_bd(a.max.den, b.dv)));
    return c;
}

std::vector<Cum> cum;
std::vector<std::pair<int, int>> input;
int size;

int get_res() {
    assert(cum[1].max.den < inf);
    int res = mul(cum[1].pr, mul(cum[1].max.num, power(cum[1].max.den, mod - 2)));
    return res;
}

void update(int i, Cum c) {
    i += size;
    cum[i] = c;
    for (i >>= 1; i > 0; i >>= 1) {
        cum[i] = merge(cum[2 * i], cum[2 * i + 1]);
    }
}

int init(int n, int X[], int Y[]) {
    size = 1 << std::__lg(std::max(1, n - 1)) + 1;
    cum.assign(size * 2, Cum(1, 1));
    input.assign(n, {});
    for (int i = 0; i < n; i++) {
        cum[size + i] = Cum(X[i], Y[i]);
        input[i] = {X[i], Y[i]};
    }
    for (int i = size - 1; i > 0; i--) {
        cum[i] = merge(cum[2 * i], cum[2 * i + 1]);
    }
    return get_res();
}

int updateX(int pos, int val) {
    input[pos].first = val;
    update(pos, Cum(input[pos].first, input[pos].second));
    return get_res();
}

int updateY(int pos, int val) {
    input[pos].second = val;
    update(pos, Cum(input[pos].first, input[pos].second));
    return get_res();
}