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

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(double *x){scanf("%lf",x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}

void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(double x, char c){printf("%.15f",x);mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

char memarr[17000000]; void *mem = memarr;
#define MD 1000000007

int fibonacci(ull n, int md){
  ull a=1, b=0, c=1, ma=1, mb=1, mc=0, ta, tb, tc;
  while(n){
    if(n%2){
      ta = a*ma + b*mb;
      tb = a*mb + b*mc;
      tc = b*mb + c*mc;
      a = ta % md;
      b = tb % md;
      c = tc % md;
    }
    ta = ma*ma + mb*mb;
    tb = ma*mb + mb*mc;
    tc = mb*mb + mc*mc;
    ma = ta % md;
    mb = tb % md;
    mc = tc % md;
    n/=2;
  }
  return b;
}

int fibonacci_fast(ull n, int md){
  int p=0;
  ull a=0, b=1, ta, tb;
  static ull ma[64], mb[64], mc[64];
  static int fg=0;

  if(!fg){
    ma[0]=mb[0]=1; mc[0]=0;
    REP(fg,1,64){
      ma[fg] = (ma[fg-1]*ma[fg-1] + mb[fg-1]*mb[fg-1]) % md;
      mb[fg] = (ma[fg-1]*mb[fg-1] + mb[fg-1]*mc[fg-1]) % md;
      mc[fg] = (mb[fg-1]*mb[fg-1] + mc[fg-1]*mc[fg-1]) % md;
    }
  }

  for(;n;p++,n/=2) if(n%2){
    ta = a*ma[p]+b*mb[p];
    tb = a*mb[p]+b*mc[p];
    a = ta % md;
    b = tb % md;
  }
  return a;
}

ull pw(ull a, ull b, ull m){ull r=1;while(b){if(b&1)r=r*a%m;b>>=1;a=a*a%m;}return r;}

int N;
ll C[100000], D[100000];
char buf[10000];

int main(){
  int i, j, k;
  ll res = 1, tmp;

  reader(&N);
  rep(i,N){
    reader(C+i);
    k = reader(buf);
    D[i] = 0;
    rep(j,k) D[i] = (D[i] * 10 + buf[j]-'0') % (MD-1);
  }

  assert(1 <= N && N <= 30000);
  rep(i,N) assert(1LL <= C[i] && C[i] <= 1000000000000000000LL);
//  rep(i,N) assert(1LL <= D[i] && D[i] <= 1000000000000000000LL);

  rep(i,N){
    tmp = fibonacci(C[i]+2, MD);
    if(tmp==0){ res=0; continue; }
    res = (res * pw(tmp, D[i], MD)) % MD;
  }
  writerLn(res);

  return 0;
}