CF1025B.Weakened Common Divisor

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

输入格式

The first line contains a single integer $n$ ( $1 \le n \le 150\,000$ ) — the number of pairs.

Each of the next $n$ lines contains two integer values $a_i$ , $b_i$ ( $2 \le a_i, b_i \le 2 \cdot 10^9$ ).

输出格式

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$ .

输入输出样例

输入#1
```
3
17 18
15 24
12 15
```
输出#1
```
6
```
输入#2
```
2
10 16
7 17
```
输出#2
```
-1
```
输入#3
```
5
90 108
45 105
75 40
165 175
33 30
```
输出#3
```
5
```

说明/提示

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.

首页