import core.thread;
import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex;

//	Input
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { tokens = readln.split; if (tokens.empty && stdin.eof) throw new EOFException; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return to!int(readToken); }
long readLong() { return to!long(readToken); }
real readReal() { return to!real(readToken); }

//	chmin/chmax
void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

//	Pair
struct Pair(S, T) {
	S x; T y;
	int opCmp(    const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	int opCmp(ref const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	string toString() const { return "(" ~ to!string(x) ~ ", " ~ to!string(y) ~ ")"; }
}
auto pair(S, T)(inout(S) x, inout(T) y) { return Pair!(S, T)(x, y); }

//	Array
int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = as.length; for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <  val); }); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <= val); }); }
T[] unique(T)(in T[] as) { T[] bs; foreach (a; as) if (bs.empty || bs[$ - 1] != a) bs ~= a; return bs; }


immutable long MO = 10^^9 + 7;

long[2] mul(in long[2] a, in long[2] b) {
	return [ (a[0] * b[0] + a[1] * b[1]) % MO, (a[0] * b[1] + a[1] * b[0] + a[1] * b[1]) % MO ];
}

int N;
BigInt[] C, D;

void main(string[] args) {
	try {
	for (; ; ) {
		N = readInt;
		C = new BigInt[N];
		D = new BigInt[N];
		foreach (i; 0 .. N) {
			C[i] = readToken.to!BigInt;
			D[i] = readToken.to!BigInt;
		}
		
		long ans = 1;
		foreach (i; 0 .. N) {
			long[2] x = [ 0, 1 ], y = [ 1, 0 ];
			for (auto e = (C[i] + 2).toLong; e; e >>= 1, x = mul(x, x)) if (e & 1) {
				y = mul(y, x);
			}
debug{
writeln(y);
}
			BigInt q = MO - 1;
			long xx = y[1], yy = 1;
			for (auto e = ((D[i] < q) ? D[i] : (q + (D[i] - q) / q * q)).toLong; e; e >>= 1, xx = (xx * xx) % MO) if (e & 1) {
				yy = (yy * xx) % MO;
			}
			(ans *= yy) %= MO;
		}
		writeln(ans);
		
	}
	} catch (EOFException) {}
}