#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int MOD=1e9+7;
int N,M,Q;

int C;
string D;

int mod_pow(int b, int e, int m) {
    int result = 1;
    
    while (e > 0) {
        if ((e & 1) == 1) result = (result * b) % m;
        e >>= 1;
        b = (b * b) % m;
    }
    
    return result;
}

int calcD() {
    int ret = 0;
    REP(i,D.size()) {
        ret *= 10;
        ret += D[i]-'0';
        ret %= MOD-1;
    }
    if (ret == 0) ret += MOD;
    return ret;
}

void matmul(int a[2][2], int b[2][2]) {
    int tmp[2][2];
    tmp[0][0] = (a[0][0]*b[0][0] + a[0][1]*b[1][0]) % MOD;
    tmp[0][1] = (a[0][0]*b[0][1] + a[0][1]*b[1][1]) % MOD;
    tmp[1][0] = (a[1][0]*b[0][0] + a[1][1]*b[1][0]) % MOD;
    tmp[1][1] = (a[1][0]*b[0][1] + a[1][1]*b[1][1]) % MOD;
    REP(x,2)REP(y,2) a[x][y]=tmp[x][y];
}

void matmul(int a[2][2], int b[2]) {
    int tmp[2];
    tmp[0] = (a[0][0]*b[0] + a[0][1]*b[1]) % MOD;
    tmp[1] = (a[1][0]*b[0] + a[1][1]*b[1]) % MOD;
    REP(i,2)b[i]=tmp[i];
}

int fib(int c) {
    int base[2][2] = {
        {1,1},
        {1,0}
    };
    int current[2] = {1,0};
    while(c) {
        if (c%2) matmul(base, current);
        matmul(base, base);
        c >>= 1;
    }
    return current[1];
}

void solve() {
    cin>>N;
    
    int ans = 1;
    while(N--) {
        D.clear();
        cin>>C>>D;
        int c = fib(C+2);
        int d = calcD();
        ans *= mod_pow(c,d,MOD);
        ans %= MOD;
    }
    
    cout << ans << endl;
}