Almost All Divisors

滴答滴答---题目链接

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

We guessed some integer number xx. You are given a list of almost all its divisors. Almost all means that there are all divisors except 11and xx in the list.

Your task is to find the minimum possible integer xx that can be the guessed number, or say that the input data is contradictory and it is impossible to find such number.

You have to answer tt independent queries.

Input

The first line of the input contains one integer tt (1≤t≤251≤t≤25) — the number of queries. Then tt queries follow.

The first line of the query contains one integer nn (1≤n≤3001≤n≤300) — the number of divisors in the list.

The second line of the query contains nn integers d1,d2,…,dnd1,d2,…,dn (2≤di≤1062≤di≤106), where didi is the ii-th divisor of the guessed number. It is guaranteed that all values didi are distinct.

Output

For each query print the answer to it.

If the input data in the query is contradictory and it is impossible to find such number xx that the given list of divisors is the list of almost allits divisors, print -1. Otherwise print the minimum possible xx.

Example

input

Copy

2
8
8 2 12 6 4 24 16 3
1
2

output

Copy

48
4

题意：

• 给出一个数所有的因子(除了本身和1） 求该数
• 如果信息错误输出-1  （缺也算）

思路：

• 将这些因子从小到大排序  最小乘最大就是该数X
• 然后就从得到的X求他的所有因子(除了1和他本身)
• 再对比题目给出的因子和他是否都相等

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        vector<ll>v1,v2;
        int n;
        scanf("%d",&n);
        for(int i=0; i<n; i++)
        {
            ll x;
            cin>>x;
            v1.push_back(x);
        }
        sort(v1.begin(),v1.end());
        ll y=v1[0]*v1[n-1];
        for(int i=2; i<=sqrt(y); i++)
        {
            if(y%i==0)
            {
                v2.push_back(i);
                if(i!=y/i) v2.push_back(y/i);
            }
        }
        sort(v2.begin(),v2.end());
        if(v1==v2) cout<<y<<endl;
        else cout<<"-1"<<endl;
    }
}