#!/usr/bin/env python3
mod = int(1e9+7)
def fib(n):
    def mul(a, b):
        c = [[0,0],[0,0]]
        for y in range(2):
            for z in range(2):
                for x in range(2):
                    c[y][x] = (c[y][x] + a[y][z] * b[z][x] % mod) % mod
        return c
    f = [[1,0],[0,1]]
    e = [[1,1],[1,0]]
    i = 0
    while (1<<i) <= n:
        if n & (1<<i):
            f = mul(f, e)
        e = mul(e, e)
        i += 1
    return f[0][0]
n = int(input())
ans = 1
for i in range(n):
    c, d = map(int,input().split())
    ans = ans * pow(fib(c+1), d, mod) % mod
print(ans)