#include "bits/stdc++.h" #include #pragma warning(disable:4996) using namespace std; using ld = long double; template using Table = vector>; const int mod = 1000000007; struct Mod { public: int num; Mod() : num(0) { ; } Mod(long long int n) : num((n % mod + mod) % mod) { ; } Mod(int n) : num((n % mod + mod) % mod) { ; } operator int() { return num; } }; Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); } Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; } Mod operator+(const Mod a, const long long int b) { return b + a; } Mod operator++(Mod &a) { return a + Mod(1); } Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); } Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; } Mod operator--(Mod &a) { return a - Mod(1); } Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); } Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; } Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; } Mod operator*(const Mod a, const int b) { return Mod(b)*a; } Mod operator+=(Mod &a, const Mod b) { return a = a + b; } Mod operator+=(long long int &a, const Mod b) { return a = a + b; } Mod operator-=(Mod &a, const Mod b) { return a = a - b; } Mod operator-=(long long int &a, const Mod b) { return a = a - b; } Mod operator*=(Mod &a, const Mod b) { return a = a * b; } Mod operator*=(long long int &a, const Mod b) { return a = a * b; } Mod operator*=(Mod& a, const long long int &b) { return a = a * b; } Mod operator^(const Mod a, const int n) { if (n == 0) return Mod(1); Mod res = (a * a) ^ (n / 2); if (n % 2) res = res * a; return res; } Mod mod_pow(const Mod a, const int n) { if (n == 0) return Mod(1); Mod res = mod_pow((a * a), (n / 2)); if (n % 2) res = res * a; return res; } Mod inv(const Mod a) { return a ^ (mod - 2); } Mod operator/(const Mod a, const Mod b) { assert(b.num != 0); return a * inv(b); } Mod operator/(const long long int a, const Mod b) { assert(b.num != 0); return Mod(a) * inv(b); } Mod operator/=(Mod &a, const Mod b) { assert(b.num != 0); return a = a * inv(b); } #define MAX_MOD_N 1024000 Mod fact[MAX_MOD_N], factinv[MAX_MOD_N]; void init() { fact[0] = Mod(1); factinv[0] = 1; for (int i = 0; i < MAX_MOD_N - 1; ++i) { fact[i + 1] = fact[i] * Mod(i + 1); factinv[i + 1] = factinv[i] / Mod(i + 1); } } Mod comb(const int a, const int b) { return fact[a] * factinv[b] * factinv[a - b]; } template vector> keisann(const vector>l, const vector>r) { vector>ans(l.size(), vector(r[0].size())); assert(l[0].size() == r.size()); for (unsigned int h = 0; h < l.size(); ++h) { for (unsigned int i = 0; i < r.size(); ++i) { for (unsigned int w = 0; w < r[0].size(); ++w) { ans[h][w] += l[h][i] * r[i][w]; } } } return ans; } template vector>powgyou(vector>a, const long long int n) { assert(a.size() == a[0].size()); if (!n) { vector>e(a.size(), vector(a[0].size())); for (unsigned int i = 0; i < a.size(); ++i) { e[i][i] = 1; } return e; } if (n == 1)return a; else { vector>ans(a.size(), vector(a[0].size(), 0)); ans = powgyou(a, n / 2); ans = keisann(ans, ans); if (n % 2) { ans = keisann(ans, a); } return ans; } } int main() { int N; cin >> N; vector>gyou(2, vector(2)); gyou[0][0] = 1; gyou[0][1] = 1; gyou[1][0] = 1; gyou[1][1] = 0; //init(); Mod finans = 1; for (int i = 0; i < N; ++i) { vector>start(2, vector(1)); start[0][0] = 1; start[1][0] = 1; long long c; string k; cin >> c >> k; vector>ans(powgyou(gyou, c-1)); ans = keisann(ans,start); Mod num = ans[0][0] + ans[1][0]; long long now = 1; long long plus = 0; while (!k.empty()) { if (k.size() < 8) { long long a(stoi(k)); plus += a*now; k.clear(); } else { long long a(stoi(k.substr(k.size() - 8, 8))); plus += a*now; k.resize(k.size() - 8); } now *= 100000000; now %= 1000000006; plus %= 1000000006ll; } finans *=mod_pow(num,plus) ; } cout << finans << endl; return 0; }