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 a1 ,a2 ,a3 ,......an
taskin asked for a minimum integer number x (x > 1) such that gcd(x,a1) = 1, gcd(x,a2) = 1, ...... gcd(x,an) = 1,
in other words you have to find a minimum integer x ( x > 1 ) such that
Note: gcd is greatest common divisor
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 a1 ,a2 ,a3 ,......an.
for every case print one integer x in one line .
Note: x should be greater than 1.
5 7 25
1 2 3 4