def mat_mul(A, B):
    C = [[0]*len(B[0]) for _ in range(len(A))]
    
    for i in range(len(A)):
        for j in range(len(B[0])):
            for k in range(len(B)):
                C[i][j] += A[i][k]*B[k][j]
                C[i][j] %= MOD
    
    return C

def mat_pow(A, n):
    res = [[0]*len(A) for _ in range(len(A))]
    
    for i in range(len(A)):
        res[i][i] = 1
        
    while n:
        if n&1:
            res = mat_mul(res, A)
        
        n >>= 1
        A = mat_mul(A, A)
    
    return res

N = int(input())
MOD = 10**9+7
ans = 1
CD = [tuple(map(int, input().split())) for _ in range(N)]
CD.sort(key=lambda k: k[0])
A = [[1, 0], [0, 1]]
prev_C = 0

for Ci, Di in CD:
    A = mat_mul(A, mat_pow([[1, 1], [1, 0]], Ci-prev_C))
    F = mat_mul(A, [[1], [1]])[0][0]%MOD
    ans *= pow(F, Di, MOD)
    ans %= MOD
    prev_C = Ci

print(ans)