text: # Problem Geometric progression with the first element a and common ratio b is a sequence of numbers a, ab, ab2, ab3, ....You are given n integer geometric progressions.Your task is to find the smallest integer x, that is the element of all the given progressions, or else state that such integer does not exist.Input The first line contains integer (1 ≤ n ≤ 100) — the number of geometric progressions.Next n lines contain pairs of integers a, b (1 ≤ a, b ≤ 109), that are the first element and the common ratio of the corresponding geometric progression.Output If the intersection of all progressions is empty, then print - 1, otherwise print the remainder of the minimal positive integer number belonging to all progressions modulo 1000000007 (109 + 7).Examples Input 2 2 2 4 1 Output 4 Input 2 2 2 3 3 Output -1 Note In the second sample test one of the progressions contains only powers of two, the other one contains only powers of three.# Solution #include <bits/stdc++.h> using std::sort; using std::swap; using std::unique; namespace fastIO { static char buf[(1 << 19)], *p1 = buf + (1 << 19), *pend = buf + (1 << 19); inline char nc() { if (p1 == pend) { p1 = buf; pend = buf + fread(buf, 1, (1 << 19), stdin); } return *p1++; } inline long long read() { long long x = 0, f = 1; register char s = nc(); for (; !isdigit(s); s = nc()) if (s == '-') f = -1; for (; isdigit(s); s = nc()) x = (x << 1) + (x << 3) + s - '0'; return x * f; } } // namespace fastIO using namespace fastIO; inline long long mabs(long long x) { return x > 0 ?x : -x; } long long gcd(long long a, long long b) { return b ?