#include <bits/stdc++.h>
using namespace std;

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define ALL(x) (x).begin(), (x).end()
#define BIT(n) (1LL<<(n))
#define SZ(x) ((int)(x).size())
#define fst first
#define snd second
using ll=long long;using pii=pair<int,int>;using vb=vector<bool>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;

const long long mod = 1000000007;

template<typename T, int N>
struct matrix_ {
  array<T, N*N> val;

  matrix_(vector<vector<T>> ini) {
    for (int i = 0; i < N; i++) for (int j = 0; j < N; j++)
      val[i * N + j] = ini[i][j];
  }

  // d=0: zero matrix, d=1: identity matrix
  matrix_(int d = 0) {
    for (int i = 0; i < N; i++) for (int j = 0; j < N; j++)
      val[i * N + j] = T((i == j) * d);
  }

  matrix_ operator+(const matrix_ &x) const {
    matrix_ ret;
    for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) {
      ret.val[i * N + j] = val[i * N + j] + x.val[i * N + j];
      if (ret.val[i * N + j] > mod) ret.val[i * N + j] -= mod;
    }
    return ret;
  }

  matrix_ operator*(const matrix_ &x) const {
    matrix_ ret;
    for (int i = 0; i < N; i++) for (int k = 0; k < N; k++) for (int j = 0; j < N; j++) {
      ret.val[i * N + j] += val[i * N + k] * x.val[k * N + j];
      if (ret.val[i * N + j] > mod) ret.val[i * N + j] %= mod;
    }
    return ret;
  }

  matrix_ operator^(unsigned long long p) const {
    matrix_ ret(1);
    matrix_ x(*this);
    while (p) {
      if (p & 1) ret = ret * x;
      x = x * x;
      p >>= 1;
    }
    return ret;
  }

  T& at(int row, int col) {
    return val[row * N + col];
  }
};
using Mat = matrix_<ll, 2>;

long long powMod(long long x, long long y) {
  long long r = 1, a = x % mod;
  while (y) {
    if (y & 1) r = (r * a) % mod;
    a = a * a % mod;
    y /= 2;
  }
  return r;
}

// x^y % mod で y がでっかくて string。
// x の値に制限なし。x が mod と互いに素のときは、powModP を使うべし
long long powModS(long long x, const string& y) {
  long long r = 1;
  x %= mod;
  for (char c : y) {
    int b = c - '0';
    r = powMod(r, 10);
    r = r * powMod(x, b);
    if (r > 100000000000000000LL) r %= mod;
  }
  return r % mod;
}

void Main() {
  int N;
  cin >> N;

  Mat a({{1,1}, {1,0}});

  ll ans = 1;
  rep(i, N) {
    ll c; string d;
    cin >> c >> d;
    Mat b = a ^ (c+1);
    ll pat = b.at(0, 0);
    (ans *= powModS(pat, d)) %= mod;
  }
  cout << ans << endl;
}
int main() { cin.tie(0); ios::sync_with_stdio(false); Main(); return 0; }