import sys
MOD=10**9+7
def mul(a, b):
    ret=[[0, 0], [0, 0]]
    for i in range(2):
        for j in range(2):
            for k in range(2):
                ret[i][j]+=a[i][k]*b[k][j]
            ret[i][j]%=MOD
    return ret

def matpow(n):
    p=[[1, 1], [1, 0]]
    ret=[[1, 0], [0, 1]]
    while n>0:
        if n%2==1:
            ret=mul(ret, p)
        p=mul(p, p)
        n//=2
    return ret

def solve(c):
    return matpow(c+2)[1][0]

n=int(input())
ans=1
for i in range(n):
    c, d=map(int, input().split())
    x=solve(c)
    if x==0:
        print(0)
        sys.exit()
    ans*=pow(x, d%(MOD-1), MOD)
    ans%=MOD
print(ans)