Problem: During the research on properties of the greatest common divisor (GCD) of a set of numbers, Ildar, a famous mathematician, introduced a brand new concept of the weakened common divisor (WCD) of a list of pairs of integers.

For a given list of pairs of integers (a_1, b_1), (a_2, b_2), ..., (a_n, b_n) their WCD is arbitrary integer greater than 1, such that it divides at least one element in each pair. WCD may not exist for some lists.

For example, if the list looks like [(12, 15), (25, 18), (10, 24)], then their WCD can be equal to 2, 3, 5 or 6 (each of these numbers is strictly greater than 1 and divides at least one number in each pair).

You're currently pursuing your PhD degree under Ildar's mentorship, and that's why this problem was delegated to you. Your task is to calculate WCD efficiently.

Input

The first line contains a single integer n (1 ≤ n ≤ 150 000) — the number of pairs.

Each of the next n lines contains two integer values a_i, b_i (2 ≤ a_i, b_i ≤ 2 ⋅ 10^9).

Output

Print a single integer — the WCD of the set of pairs. 

If there are multiple possible answers, output any; if there is no answer, print -1.

Examples

Input

3
17 18
15 24
12 15


Output

6

Input

2
10 16
7 17


Output

-1


Input

5
90 108
45 105
75 40
165 175
33 30


Output

5

Note

In the first example the answer is 6 since it divides 18 from the first pair, 24 from the second and 12 from the third ones. Note that other valid answers will also be accepted.

In the second example there are no integers greater than 1 satisfying the conditions.

In the third example one of the possible answers is 5. Note that, for example, 15 is also allowed, but it's not necessary to maximize the output.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
inline int read() {
  int x = 0, k = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') k = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9')
    x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
  return x * k;
}
struct node {
  int a, b;
} x[200005];
int prime[200005];
int p1[200005], p2[200005];
int c1[200005], c2[200005];
int m1, m2;
int judge;
bool isprime(int x) {
  if (x == 0 || x == 1) return 0;
  for (int i = 2; i <= sqrt(x); i++) {
    if (x % i == 0) return 0;
  }
  return 1;
}
void divide1(int n) {
  m1 = 0;
  for (int i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) {
      p1[++m1] = i;
      while (n % i == 0) n /= i;
    }
  }
  if (n > 1) p1[++m1] = n;
}
void divide2(int n) {
  m2 = 0;
  for (int i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) {
      p2[++m2] = i;
      while (n % i == 0) n /= i;
    }
  }
  if (n > 1) p2[++m2] = n;
}
int main() {
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  int i, j;
  for (i = 1; i <= n; i++) {
    cin >> x[i].a >> x[i].b;
  }
  for (i = 1; i <= n; i++) {
    if (x[i].a == 1 && x[i].b == 1) {
      cout << -1 << endl;
      return 0;
    }
  }
  divide1(x[1].a);
  divide2(x[1].b);
  int flag = 0, ans;
  j = 0;
  for (i = 1; i <= m1; i++) {
    prime[j] = p1[i];
    j++;
  }
  for (i = 1; i <= m2; i++) {
    prime[j] = p2[i];
    j++;
  }
  int cnt;
  cnt = unique(prime, prime + j) - prime;
  int k, tt;
  for (i = 0; i < cnt; i++) {
    for (j = 2; j <= n; j++) {
      if (x[j].a % prime[i] == 0 || x[j].b % prime[i] == 0) {
        continue;
      } else
        break;
    }
    if (j > n) {
      ans = prime[i];
      flag = 1;
      break;
    }
  }
  if (flag)
    cout << ans << endl;
  else
    cout << -1 << endl;
  return 0;
}