#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
vector<vector<ll>> matrixmul(int l, int m, int n, vector<vector<ll>> a, vector<vector<ll>> b){
	vector<vector<ll>> c;
	for(int i=0; i<l; i++){
		vector<ll> v;
		for(int j=0; j<n; j++){
			ll x=0;
			for(int k=0; k<m; k++){
				x+=(a[i][k]*b[k][j]);
				x%=MOD;
			}
			v.push_back(x);
		}
		c.push_back(v);
	}
	return c;
}
vector<vector<ll>> matrixpow(int n, vector<vector<ll>> a, ll k){
	vector<vector<ll>> ap=a, ans;
	for(int i=0; i<n; i++){
		vector<ll> v;
		for(int j=0; j<n; j++){
			if(i==j){
				v.push_back(1);
			}else{
				v.push_back(0);
			}
		}
		ans.push_back(v);
	}
	while(k){
		if(k&1) ans=matrixmul(n, n, n, ap, ans);
		ap=matrixmul(n, n, n, ap, ap);
		k>>=1;
	}
	return ans;
}
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
ll solve(ll c){
    vector<vector<ll>> a(2, vector<ll>(2));
    a[0][0]=a[0][1]=a[1][0]=1;
    vector<vector<ll>> ap=matrixpow(2, a, c+2);
    return ap[1][0];
}
ll mod(string d){
    ll p=1, ret=0;
    for(int i=d.size()-1; i>=0; i--){
        (ret+=p*(d[i]-'0'))%=(MOD-1);
        (p*=10)%=(MOD-1);
    }
    return ret;
}
int main()
{
    int n; cin>>n;
    ll ans=1;
    for(int i=0; i<n; i++){
        ll c;
        string d;
        cin>>c>>d;
        ll x=solve(c);
        if(x==0){
            cout<<0<<endl;
            return 0;
        }
        (ans*=powmod(x, mod(d)))%=MOD;
    }
    cout<<ans<<endl;
    return 0;
}