import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

md = 10 ** 9 + 7
def mul(aa, bb):
    res = [0] * 3
    for i, a in enumerate(aa):
        for j, b in enumerate(bb):
            res[i + j] += a * b
    res[0] += res[2]
    res[1] += res[2]
    res[0] %= md
    res[1] %= md
    return res[:2]

def f(n):
    f0 = [1, 0]
    f1 = [0, 1]
    f2 = [1, 1]
    if n & 1: res = f1
    else: res=f0
    while n:
        n >>= 1
        if n & 1: res = mul(res, f2)
        f2 = mul(f2, f2)
    return res[0]*1+res[1]*2 % md

def main():
    n=II()
    ans=1
    for _ in range(n):
        c,d=MI()
        ans*=pow(f(c),d,md)
        ans%=md
    print(ans)

main()