## GCDS - Sabbir and gcd problem

Sabbir is a little boy. He loves math very much. one day his friend taskin gave him a very hard task. taskin gave him * n* numbers

**a**_{1 },a_{2 },a_{3 },......a_{n}

taskin asked for a minimum integer number * x* (

**x > 1**) such that

*,*

**gcd(x,a**_{1}) = 1, gcd(x,a_{2}) = 1, ...... gcd(x,a_{n}) = 1in other words you have to find a minimum integer *x ( x > 1 )* such that

**Note: ****gcd is greatest common divisor**

### Input

In the first line there will be an integer **T , **denoting the number of test cases,

each test case is consists of 2 lines..

in the first line there will be **n , **denoting the number of integers and next line contains **n **space separated** **integers **a _{1 },a_{2 },a_{3 },......a_{n.}**

### Output

for every case print one integer **x** in one line .

Note: **x** should be greater than 1.

### Example

**Input:**

3

3

5 7 25

4

1 2 3 4

1

2

**Output:**

2

5

3

Added by: | sabbir |

Date: | 2017-02-23 |

Time limit: | 0.400s-0.699s |

Source limit: | 50000B |

Memory limit: | 1536MB |

Cluster: | Cube (Intel G860) |

Languages: | All |