#include <bits/stdc++.h>
#define rep(i, a) rep2 (i, 0, a)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) repr2 (i, 0, a)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define asn(a, b, c) fill_n(&(b), sizeof(a) / sizeof(b), c)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

void matmul(ll A[2][2], ll B[2][2]) {
	ll a[2][2], b[2][2];
	rep (i, 2) {
		rep (j, 2) {
			a[i][j] = A[i][j];
			b[i][j] = B[i][j];
			B[i][j] = 0;
		}
	}
	rep (i, 2) {
		rep (k, 2) {
			rep (j, 2) {
				(B[i][j] += a[i][k] * b[k][j]) %= mod;
			}
		}
	}
}

void matpow(ll A[2][2], ll b, ll res[2][2]) {
	rep (i, 2) rep (j, 2) res[i][j] = i == j;
	while (b) {
		if (b & 1) matmul(A, res);
		matmul(A, A);
		b >>= 1;
	}
}

ll modpow(ll a, ll b) {
	ll res = 1;
	while (b > 0) {
		if (b & 1) (res *= a) %= mod;
		(a *= a) %= mod;
		b >>= 1;
	}
	return res;
}

ll bigmodulo(string &s, ll m) {
	ll res = 0;
	for (char d : s) {
		res *= 10;
		res += d - '0';
		res %= m;		
	}
	return res;
}

ll bigmodpow(ll a, string &b) {
	if (a == 0) return 0;
	ll B = bigmodulo(b, mod - 1);
	return modpow(a, B);	
}

int main() {
	int N;
	cin >> N;
	ll ans = 1;
	rep (i, N) {
		ll C;
		string D;
		cin >> C >> D;

		ll A[2][2] = {{1, 1}, {1, 0}};
		ll An[2][2];
		matpow(A, C, An);
		ll m = (An[0][0] + An[1][0]) % mod;
		ans *= bigmodpow(m, D);
		ans %= mod;
	}
	cout << ans << endl;

	return 0;
}