/*
  reffered to http://kmjp.hatenablog.jp/entry/2015/02/09/0900
 */
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define MOD2 1000000006LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

/*行列*/
typedef vector <ll> vec;
typedef vector <vec> mat;


mat mul(mat &A,mat &B){//行列掛け算 A*B
  mat C(sz(A), vec(sz(B[0]),0));
  rep(i,sz(A)){
    rep(k,sz(B)){
      rep(j,sz(B[0])){
	C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % MOD;
      }
    }
  }
  return C;
}

mat pow(mat &A,ll n){
  mat B(sz(A),vec(sz(A),0));
  rep(i,sz(B)){
    B[i][i] = 1;
  }
  while(n > 0){
    if(n & 1){
      B = mul(B,A);
    }
    A = mul(A,A);
    n >>= 1;
  }
  return B;
}

ll fib(const ll x){
  vector <vector <ll> > A(2,vector <ll> (2));
  A[0][0] = 1;
  A[0][1] = 1;
  A[1][0] = 1;
  A[1][1] = 0;
  auto An = pow(A,x);
  return An[1][0] % MOD;
}

ll calc(const ll x){
  return fib(x+2);
}

ll pow_mod(ll x,ll p){//x^p % mod
  ll res = (x!=0);
  while(p > 0){
    if(p & 1){
      res = (res * x) % MOD;
    }
    x = (x * x) % MOD;
    p >>= 1;
  }
  return res;
}

ll calc2(string &y){
  ll ret = 0;
  rep(i,sz(y)){
    ret = ret * 10 + (y[i]-'0');
    ret %= MOD2;
  }
  return ret;
}



int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int N;
  cin >> N;
  ll ans = 1;
  rep(i,N){
    ll x;
    string y;
    cin >> x;
    cin >> y;
    ans *= pow_mod(calc(x),calc2(y));
    //DEBUG2(calc(x),calc2(y,MOD));
    ans %= MOD;
  }
  cout << ans << endl;
  return 0;
}