#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
vector<vector<mint>> mul(vector<vector<mint>>A, vector<vector<mint>>B) {
	vector<vector<mint>> C(A.size(), vector<mint>(B[0].size()));
	rep(i, A.size()) rep(j, B[0].size()) rep(k, A[0].size()) C[i][j] += A[i][k] * B[k][j];
	return C;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int l; cin >> l;
	mint ans = 1;
	while (l--) {
		int p, c; cin >> p >> c;
		vector<vector<mint>> mans(3, vector<mint>(3));
		rep(i, 3)mans[i][i] = 1;
		vector<vector<mint>> mpow(3, vector<mint>(3));
		mpow[0][0] = 1, mpow[0][1] = p, mpow[0][2] = 1;
		mpow[1][0] = 0, mpow[1][1] = p, mpow[1][2] = 1;
		mpow[2][0] = 0, mpow[2][1] = 0, mpow[2][2] = 1;
		while (c > 0) {
			if (1 == c % 2) mans = mul(mpow, mans);
			c /= 2;
			mpow = mul(mpow, mpow);
		}
		mint sub = 0;
		rep(i, 3)sub += mans[0][i];
		ans *= sub;
	}
	cout << ans.val() << endl;
	return 0;
}