# Enter your code here. Read input from STDIN. Print output to STDOUT
from functools import reduce
m = 1000000007

def mul_m(a, b):
    return a * b % m

def zpow(a, b, m):
    return 0 if b == 0 else pow(a, b, m)

n = int(input())
a = [0] * n
b = [0] * n
p = [0] * n
for i in range(n):
    p[i], b[i], a[i] = map(int, input().split())
B = reduce(mul_m, [pow(p[i], b[i], m) for i in range(n)])
if all(a[i] == b[i] for i in range(n)):
    print(B * 2 % m)
else:
    print(B * reduce(mul_m, [1 + zpow(p[i], a[i] - b[i], m) for i in range(n)]) % m)

from fractions import gcd
n = int(input())
A = 1
B = 1
for _ in range(n):
    p1,b1,a1 = map(int, input().split())
    A *= pow(p1,a1)
    B *= pow(p1,b1)
num = 0
for j in range(B,A+1,B):
    for k in range(B,A+1,B):
        if j <= k and gcd(j,k) == B and j*k == A*B:
            num += j+k
print(num%(pow(10,9)+7))