#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int n;
ll c[30010];
string d[30010];
const ll base = 1e9;
typedef vector<int> BigInt;

void Set(BigInt &a) {
    while (a.size() > 1 && a.back() == 0) a.pop_back();
}

BigInt Integer(string s) {
    BigInt ans;
    if (s[0] == '-') return ans;
    if (s.size() == 0) {ans.push_back(0); return ans;}
    while (s.size() % 9 != 0) s = '0'+s;
    for (int i = 0; i < s.size(); i += 9) {
        int v = 0;
        for (int j = i; j < i+9; j++) v = v * 10 + (s[j]-'0');
        ans.insert(ans.begin(), v);
    }
    Set(ans);
    return ans;
}
BigInt Integer(ll x) {
    string s = "";
    while (x > 0) s = char(x%10+'0') + s, x /= 10;
    return Integer(s);
}
int operator % (BigInt a, ll b) {
    Set(a);
    if (b == 0) return -1;
    int ans = 0;
    for (int i = a.size()-1; i >= 0; i--) {
        ans = (ans * (base%b) + a[i]%b) % b;
    }
    return ans;
}

typedef vector<int> vec;
typedef vector<vec> mat;

mat mult(mat &A, mat &B) {
    mat C(A.size(), vec(B[0].size()));
    for (int i = 0; i < A.size(); i++) {
        for (int k = 0; k < B.size(); k++) {
            for (int j = 0; j < B[0].size(); j++) {
                C[i][j] = (C[i][j] + A[i][k]*B[k][j] + mod) % mod;
            }
        }
    }
    return C;
}

mat pow(mat A, ll n) {
    mat B(A.size(), vec(A.size()));
    for (int i = 0; i < A.size(); i++)
        B[i][i] = 1;
    while (n > 0) {
        if (n & 1) B = mult(B, A);
        A = mult(A, A);
        n >>= 1;
    }
    return B;
}

ll mod_pow(ll x, ll n) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = (res * x) % mod;
        x = (x * x) % mod;
        n >>= 1;
    }
    return res;
}

ll solve() {
    ll res = 1;
    mat A = vector<vector<int> >(2, vector<int>(2, 0));
    A[0][0] = A[0][1] = A[1][0] = 1;
    for (int i = 0; i < n; i++) {
        mat B = pow(A, c[i]-1);
        ll a = (B[0][0] * 2 + B[0][1]) % mod;
        ll e = Integer(d[i]) % (int)(1e9+6);
        res *= mod_pow(a, e);
        res %= mod;
    }
    return res;
}

void input() {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> c[i] >> d[i];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    cout << solve() << endl;
}