import math

def fib_modulo(m):
    fib = [0, 1]
    i = 2
    while True:
        fib.append((fib[i-1] + fib[i-2]) % m)
        if fib[i] == fib[1] and fib[i-1] == fib[0]:
            return fib[:-2]
        i += 1

def solve(n, pk):
    MOD = 10**9 + 7
    cycles = [len(fib_modulo(p**k)) for p, k in pk]
    lcm = cycles[0]
    for c in cycles[1:]:
        lcm = lcm * c // math.gcd(lcm, c)
    return lcm % MOD

n = int(input())
pk = [list(map(int, input().split())) for _ in range(n)]
print(solve(n, pk))