#define _CRT_SECURE_NO_WARNINGS //#define _GLIBCXX_DEBUG #include using namespace std; typedef long long ll; typedef vector vi; typedef vector vvi; typedef pair pii; #define all(c) (c).begin(), (c).end() #define loop(i,a,b) for(ll i=a; i istream & operator>>(istream & is, vector &); template ostream & operator<<(ostream & os, vector const &); template typename enable_if<(n>=sizeof...(T))>::type _ot(ostream &, tuple const &){} template typename enable_if<(n< sizeof...(T))>::type _ot(ostream & os, tuple const & t){ os << (n==0?"":" ") << get(t); _ot(os, t); } template ostream & operator<<(ostream & os, tuple const & t){ _ot<0>(os, t); return os; } template typename enable_if<(n>=sizeof...(T))>::type _it(istream &, tuple &){} template typename enable_if<(n< sizeof...(T))>::type _it(istream & is, tuple & t){ is >> get(t); _it(is, t); } template istream & operator>>(istream & is, tuple & t){ _it<0>(is, t); return is; } template istream & operator<<(istream & is, pair & p){ return is >> p.first >> p.second; } template ostream & operator<<(ostream & os, pair const & p){ return os << "(" << p.first << ", " << p.second << ") "; } template istream & operator>>(istream & is, vector & v){ rep(i,v.size()) is >> v[i]; return is; } template ostream & operator<<(ostream & os, vector const & v){ rep(i,v.size()) os << v[i] << (i+1==(int)v.size()?"":" "); return os; } #ifdef DEBUG #define dump(...) (cerr<<#__VA_ARGS__<<" = "< struct Mint { int x; explicit Mint() : x(0) {} explicit Mint(int y){ if((x = y%M + M) >= M) x-= M; } Mint & operator += (MCR m){ if((x += m.x) >= M) x-=M; return *this; } Mint & operator -= (MCR m){ if((x += M-m.x) >= M) x-=M; return *this; } Mint & operator *= (MCR m){ x = 1LL * x * m.x % M; return *this; } Mint & operator /= (MCR m){ x = (1LL * x * m.exp(M-2).x) % M; return *this; } Mint operator + (MCR m) const { return Mint(*this) += m; } Mint operator - (MCR m) const { return Mint(*this) -= m; } Mint operator * (MCR m) const { return Mint(*this) *= m; } Mint operator / (MCR m) const { return Mint(*this) /= m; } bool operator < (MCR m) const { return x < m.x; } Mint inv() const { return exp(M-2); } Mint exp(long long t) const { /* !! default 0^0 = 1 !! */ if(x==0) return Mint(0); Mint e = *this, res = Mint(1); for(; t; e*=e, t>>=1) if(t&1) res *= e; return res; } }; template ostream &operator << (ostream & os, Mint m){ return os << m.x; } #undef MCR #define MCR Mat const & template struct Mat { unique_ptr dat; int height, width; explicit Mat(int height_, int width_) : height(height_), width(width_){ dat = unique_ptr(new T[height*width]); } Mat(MCR m){ width = m.width; height = m.height; dat = unique_ptr(new T[height*width]); rep(i,width*height) dat.get()[i] = m.dat.get()[i]; } Mat & operator = (MCR m) { width = m.width; height = m.height; dat = unique_ptr(new T[height*width]); rep(i,width*height) dat.get()[i] = m.dat.get()[i]; return *this; } T * operator [] (int i) const { return dat.get() + i*width; } Mat & operator += (MCR x){ rep(i,height) rep(j,width) dat[i][j] += x[i][j]; return *this; } Mat & operator -= (MCR x){ rep(i,height) rep(j,width) dat[i][j] -= x[i][j]; return *this; } Mat & operator *= (MCR b){ Mat res(height, b.width); rep(i,height) rep(k,b.height) rep(j,b.width) res[i][j] += (*this)[i][k]*b[k][j]; return *this = res; } Mat operator + (MCR x) const { return Mat(*this) += x; } Mat operator - (MCR x) const { return Mat(*this) -= x; } Mat operator * (MCR x) const { return Mat(*this) *= x; } Mat exp(ll t) const { Mat e = *this, res = id(height); for(; t; e*=e, t>>=1) if(t&1) res *= e; return res; } Mat trans() const { Mat t(width, height); rep(i,width) rep(j,height) t[i][j] = dat[j][i]; return t; } static Mat id (int n) { Mat res(n,n); rep(i,n) res[i][i] = T(1); return res; } }; ll strMod(string const & s, ll M){ ll a = 0; rep(i, s.size()) a = (s[i] - '0' + a*10) % M; return a; } int const mod = 1000000007; typedef Mint mint; typedef Mat mat; mint fibonacci(ll n){ mat a(2,2); a[0][0] = mint(0); a[0][1] = mint(1); a[1][0] = mint(1); a[1][1] = mint(1); mat b(2,1); b[0][0] = mint(1); b[1][0] = mint(2); mat ans = a.exp(n) * b; return ans[0][0]; } int main(){ #ifdef LOCAL freopen("in","r",stdin); #endif int n; while(cin >> n){ mint ans(1); rep(i,n){ ll c; string d; cin >> c >> d; ll e = strMod(d,mod-1); ans *= fibonacci(c).exp(e); } cout << ans << endl; } }