#coding:utf-8 from __future__ import ( absolute_import, division, print_function, unicode_literals, ) def mod_inv(x, m): """ a*x = 1 (mod m) return a """ y, u, v = m, 1, 0 while y: t = x // y x, y = y, x - t * y u, v = v, u - t * v return (u % m + m) % m def factor(x): m = 2 while m * m <= x: if x % m == 0: yield m while x % m == 0: x //= m m += 1 if x > 1: yield x def gcd(x, y): return gcd(y, x % y) if y else x def f_lower(x, f): r = 1 while x % f == 0: x //= f r *= f return r def CRT_pre(eqs): N = len(eqs) for i in range(N): for j in range(i + 1, N): for p in factor(gcd(eqs[i][2], eqs[j][2])): fs = map(lambda x: f_lower(x[2], p), eqs) ma = max(fs) idx = fs.index(ma) for k in range(N): if k == idx: continue if eqs[k][1] % fs[k] != eqs[idx][1] % fs[k]: return False eqs[k][2] //= fs[k] eqs[k][1] %= eqs[k][2] return True def CRT(eqs): """ eqs = [(a,b,m), ...] ax = b (mod m) coprime a, m coprime m[i], m[j] if i != j >>> eqs = [(1, 32134, 1584891), (1, 193127, 3438478)] ... assert CRT(eqs) == (717283526504001097, 5449612835898), "CpawCTF Q26 Failed." """ mod = reduce(lambda a,x: a*x[2], eqs, 1) m = map(lambda x: mod // x[2], eqs) c = map(lambda x: mod_inv(x[0][0] * x[1], x[0][2]), zip(eqs, m)) return reduce(lambda a,x: a + x[0] * x[1] * x[2][1], zip(m, c, eqs), 0), mod def main(): MOD = 10 ** 9 + 7 N = int(raw_input()) eqs = [[1] + map(int, raw_input().split(" ")) for _ in range(N)] if not CRT_pre(eqs): print(-1) elif any(map(lambda x: x[1], eqs)): c, m = CRT(eqs) print((c % m) % MOD) else: print(reduce(lambda a,x: a*x[2], eqs, 1) % MOD) if __name__ == "__main__": main()