MOD = 10**9 + 7
PHI = MOD - 1

def fib(n, mod):
    def fast_doubling(n):
        if n == 0:
            return (0, 1)
        a, b = fast_doubling(n // 2)
        c = (a * (2 * b - a)) % mod
        d = (a * a + b * b) % mod
        if n % 2 == 1:
            return (d, (c + d) % mod)
        else:
            return (c, d)
    return fast_doubling(n)[0]

def mod_string(s, m):
    res = 0
    for c in s:
        res = (res * 10 + int(c)) % m
    return res

def main():
    import sys
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr])
    ptr += 1
    product = 1
    for _ in range(N):
        C_k = int(input[ptr])
        ptr += 1
        D_str = input[ptr]
        ptr += 1
        n = C_k + 2
        a = fib(n, MOD)
        if a == 0:
            contrib = 0
        else:
            exponent = mod_string(D_str, PHI)
            contrib = pow(a, exponent, MOD)
        product = (product * contrib) % MOD
    print(product % MOD)

if __name__ == "__main__":
    main()