#!/usr/bin/python
mod = int(1e9) + 7

def matmul(A, B):
    p, q = len(A[0]), len(B)
    if p != q:
        print 'len(A[0])={} len(B)={}'.format(p, q)
        return None
    rows, cols, times = len(A), len(B[0]), len(A[0])
    res = [[0 for _ in xrange(cols)] for _ in xrange(rows)]
    for r in xrange(rows):
        for c in xrange(cols):
            res[r][c] = sum(A[r][i]*B[i][c] for i in xrange(times)) % mod
    return res

def matpow(A, n):
    sz = len(A)
    res = [[1 if i==j else 0 for j in xrange(sz)] for i in xrange(sz)]
    while n > 0:
        if n & 1:
            res = matmul(res, A)
        A = matmul(A, A)
        n >>= 1
    return res

n = int(raw_input())
res = 1
for i in xrange(n):
    c, d = map(int, raw_input().split())
    x = matpow([[1, 1], [1, 0]], c+1)[0][0]
    if d > mod - 1:
        d %= (mod - 1)
    res = res * pow(x, d, mod) % mod
print res