#include #include using namespace std; const int NUM_DATA = 30005; const int MOD = 1000000007; const int LENG = 205; class Matrix { public: int v[2][2]; Matrix(){ memset(v, 0, sizeof(v)); } }; int N; long long C[NUM_DATA]; int lengD[NUM_DATA], D[NUM_DATA][LENG]; void read() { cin >> N; for (int i = 0; i < N; ++i) { string DStr; cin >> C[i] >> DStr; lengD[i] = DStr.size(); for (int j = 0; j < DStr.size(); ++j) D[i][j] = DStr[j] - '0'; } } Matrix matmul(const Matrix &a, const Matrix &b) { Matrix c; for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j) { int toPush = 0; for (int k = 0; k < 2; ++k) toPush = (toPush + 1LL * a.v[i][k] * b.v[k][j]) % MOD; c.v[i][j] = toPush; } return c; } Matrix matpow(Matrix &p, long long n) { if (n == 0) { Matrix I; I.v[0][0] = 1; I.v[0][1] = 0; I.v[1][0] = 0; I.v[1][1] = 1; return I; } Matrix t = matpow(p, n / 2); return n & 1 ? matmul(matmul(t, t), p) : matmul(t, t); } int mypow(int p, int leng, int n[LENG]) { int bgn = 0; int ret = 1; while (1) { if (n[leng - 1] % 2 == 1) { ret = 1LL * ret * p % MOD; } p = 1LL * p * p % MOD; while (bgn < leng && n[bgn] == 0) ++bgn; if (bgn == leng) break; // n /= 2 int carry = 0; for (int i = bgn; i < leng; ++i) { int nextCarry = (n[i] + carry * 10) & 1; n[i] = (n[i] + carry * 10) >> 1; carry = nextCarry; } } return ret; } void work() { // 1, 1 // 1, 0 Matrix mat; mat.v[0][0] = 1; mat.v[0][1] = 1; mat.v[1][0] = 1; mat.v[1][1] = 0; int ans = 1; for (int i = 0; i < N; ++i) { Matrix t = matpow(mat, C[i] + 1); ans = 1LL * ans * mypow(t.v[0][0], lengD[i], D[i]) % MOD; } cout << ans << endl; } int main() { read(); work(); return 0; }