#include<iostream>
#include<vector>
using namespace std;
const int NUM_DATA = 30005;
const int LENG = 205;
const int MOD = 1000000007;
typedef vector<int> VI;
typedef vector<VI> VII;

int N;
long long C[NUM_DATA];
string D[NUM_DATA];

void read() {
    cin >> N;
    for (int i = 0; i < N; ++i) {
        cin >> C[i] >> D[i];
        for (int j = 0; j < D[i].size(); ++j)
            D[i][j] -= '0';
    }
}


VII matmul(const VII &a, const VII &b) {
    VII c = VII(a.size(), VI());
    for (int i = 0; i < a.size(); ++i)
        for (int j = 0; j < b[0].size(); ++j) {
            int toPush = 0;
            for (int k = 0; k < a[0].size(); ++k)
                toPush = (toPush + 1LL * a[i][k] * b[k][j] % MOD) % MOD;
            c[i].push_back(toPush);
        }
    return c;
}


VII matpow(VII &p, long long n) {
    if (n == 0) {
        // 1, 0
        // 0, 1
        VII I(2, VI());
        I[0].push_back(1); I[0].push_back(0);
        I[1].push_back(0); I[1].push_back(1);
        return I;
    }
    
    VII t = matpow(p, n / 2);
    return n & 1 ? matmul(matmul(t, t), p) : matmul(t, t);
}


int mypow(int p, string s) {
    int bgn = 0;
    int ret = 1;
    
    while (1) {
        if (s[s.size() - 1] % 2 == 1) {
            ret = 1LL * ret * p % MOD;
        }
        p = 1LL * p * p % MOD;
        
        
        while (bgn < s.size() && s[bgn] == 0) ++bgn;
        if (bgn == s.size()) break;
        
        // s /= 2
        int carry = 0;
        for (int i = bgn; i < s.size(); ++i) {
            int nextCarry = (s[i] + carry * 10) % 2;
            s[i] = (s[i] + carry * 10) / 2;
            carry = nextCarry;
        }
    }
    
    return ret;
}


void work() {
    // 1, 1
    // 1, 0
    VII vii(2, VI());
    vii[0].push_back(1); vii[0].push_back(1);
    vii[1].push_back(1); vii[1].push_back(0);
    
    int ans = 1;
    for (int i = 0; i < N; ++i) {
        VII mat = matpow(vii, C[i] + 1);
        ans = 1LL * ans * mypow(mat[0][0], D[i]) % MOD;
    }
    cout << ans << endl;
}


int main() {
    read();
    work();
    return 0;
}