#include <iostream>
#include <algorithm>
using namespace std;
using i64 = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

const int mod = int(1e9) + 7;

vector<vector<i64>> matmul(vector<vector<i64>> a, vector<vector<i64>> b) {
  int p = a.size(), q = b[0].size(), r = b.size();
  vector<vector<i64>> res(p, vector<i64>(q));
  for(int i=0; i<p; i++) {
    for(int k=0; k<r; k++) {
      for(int j=0; j<q; j++) {
        (res[i][j] += a[i][k] * b[k][j]) %= mod;
      }
    }
  }
  return res;
}

vector<vector<i64>> matpow(vector<vector<i64>> a, i64 n) {
  int p = a.size();
  vector<vector<i64>> res(p, vector<i64>(p));
  for(int i=0; i<p; i++) {
    for(int j=0; j<p; j++) {
      res[i][j] = i==j;
    }
  }
  for(i64 x=n; x>0; x>>=1) {
    if(x & 1) { res = matmul(res, a); }
    a = matmul(a, a);
  }
  return res;
}

i64 mod_pow(i64 a, i64 n, i64 mod) {
  i64 res = 1LL;
  for(i64 p=a, x=n; x>0; x>>=1) {
    if(x & 1) { (res *= p) %= mod; }
    (p *= p) %= mod;
  }
  return res;
}

i64 to_modint(string s, i64 mod) {
  i64 res = 0;
  int n = s.size();
  for(int i=0; i<n; i++) {
    (res *= 10) += (s[i] - '0');
    res %= mod;
  }
  return res ? res : mod-1;
}

int main(void) {
  int n; scanf("%d", &n);
  i64 res = 1;
  for(int i : range(n)) {
    i64 c; string d; cin >> c >> d;
    vector<vector<i64>> mat = {{1, 1}, {1, 0}};
    i64 x = matpow(mat, c+1)[0][0],
        y = to_modint(d, mod-1),
        z = mod_pow(x, y, mod);
    (res *= z) %= mod;
  }
  printf("%d\n", int(res));
  return 0;
}