# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
from collections import *
from itertools import *
from functools import *
import math,sys
input = sys.stdin.readline

mod = 10**9 + 7

def matrix_mul(A,B,mod = None):
    nA = len(A)
    mA = len(A[0])
    mB = len(B[0])
    
    tmp = [[0]*mB for _ in range(nA)]
    tB = list(zip(*B))
    if mod is None:
        for i in range(nA):
            Ai = A[i]
            for j in range(mB):
                Bj = tB[j]
                tmp[i][j] = sum(Ai[k]*Bj[k] for k in range(mA))
        return tmp

    for i in range(nA):
        Ai = A[i]
        for j in range(mB):
            Bj = tB[j]
            tmp[i][j] = sum(Ai[k]*Bj[k] for k in range(mA))%mod
    return tmp
    

def matrix_pow(A,n,mod = None):
    nbit = list(str(bin(n))[2:])
    nbit = [int(i) for i in nbit]
    N = len(A)
    C = [[0]*N for _ in range(N)]
    B = A
    for i in range(N):
        C[i][i] = 1
        
    if mod is None:
        
        for i in range(len(nbit)):
            if nbit[-1-i] == 1:
                C = matrix_mul(C,B)
            
            B = matrix_mul(B,B)
        return C
        
    for i in range(len(nbit)):
        if nbit[-1-i] == 1:
            C = matrix_mul(C,B,mod)
        
        B = matrix_mul(B,B,mod)
    
    return C
    
    
N = int(input())

CD = [tuple(map(int,input().split())) for _ in range(N)]

X = [[0,1],[1,1]]
I = [[1],[1]]
ans = 1
for c,d in CD:
    Y = matrix_mul(matrix_pow(X,c-1,mod),I,mod)
    a,b = Y[0][0],Y[1][0]
    ans *= pow(a+b,d,mod)
    ans %= mod
print(ans)