#include "horses.h"

// Skyqwq
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back

typedef long long LL;
typedef pair<int, int> PII;


template <typename T> bool inline chkMin(T &x, T y) { return y < x ? x = y, 1 : 0; }
template <typename T> bool inline chkMax(T &x, T y) { return y > x ? x = y, 1 : 0; }

const int N = 5e5 + 5, P = 1e9 + 7;

int w[N << 2], mx[N << 2], n, s[N << 2];

#define ls (p << 1)
#define rs (p << 1 | 1)

void pu(int p) {
	w[p] = max(w[ls], w[rs]);
	mx[p] = max(mx[ls], mx[rs]);
	s[p] = 1ll * s[ls] * s[rs] % P;
}

void chg(int p, int l, int r, int x, int X, int o) {
	if (l == r) {
		if (!o) mx[p] = X, s[p] = X;
		else w[p] = X;
		return;
	}
	int mid = (l + r) >> 1;
	if (x <= mid) chg(ls, l, mid, x, X, o);
	else chg(rs, mid + 1, r, x, X, o);
	pu(p);
}

LL v;

LL now;

int zl;

void wk(int p, int l, int r) {
	if (v > 1e9) {
		zl = 1ll * s[p] * zl % P;
		now = 1ll * s[p] * now % P;
		return;
	}
	if (l == r) {
		now = 1ll * s[p] * now % P;
		v = max(v, (LL)w[p]);
		v *= s[p];
		return;
	}
	if (mx[p] == 1) {
		v = max(v, (LL)w[p]);
		return;
	}
	int mid = (l + r) >> 1;
	wk(rs, mid + 1, r);
	wk(ls, l, mid);
}

int inline ask() {
	now = 1, v = 0, zl = 1;
	wk(1, 0, n - 1);
	return v % P * zl % P;
}

int init(int N, int X[], int Y[]) {
	n = N;
	for (int i = 0; i < n; i++) chg(1, 0, n - 1, i, X[i], 0), chg(1, 0, n - 1, i, Y[i], 1);
	return ask();
}

int updateX(int pos, int val) {	
	chg(1, 0, n - 1, pos, val, 0);
	return ask();
}

int updateY(int pos, int val) {
	chg(1, 0, n - 1, pos, val, 1);
	return ask();
}