#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;

typedef vector<ll> vec;
typedef vector<vec> mat;

mat matmul(mat A, mat B) {
	mat res(A.size(), vec(B[0].size()));
	rep (i, A.size()) rep (k, B.size()) rep (j, B[0].size()) {
		(res[i][j] += A[i][k] * B[k][j]) %= mod;
	}
	return res;
}

mat identity(int n) {
	mat res(n, vec(n));
	rep (i, n) res[i][i] = 1;
	return res;
}

mat matpow(mat A, ll b) {
	mat res = identity(A.size());
	while (b) {
		if (b & 1) res = matmul(res, A);
		A = matmul(A, A);
		b >>= 1;
	}
	return res;
}

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) {
	ll B = bigmodulo(b, mod - 1);
	return modpow(a, B);	
}

int main() {
	mat A{{1, 1}, {1, 0}};

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

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

	return 0;
}