Codeforces Round #570 (Div. 3)F. Topforces Strikes Back

原题出处：http://codeforces.com/contest/1183/problem/F

One important contest will take place on the most famous programming platform (Topforces) very soon!

The authors have a pool of nn problems and should choose at most three of them into this contest. The prettiness of the ii-th problem is aiai. The authors have to compose the most pretty contest (in other words, the cumulative prettinesses of chosen problems should be maximum possible).

But there is one important thing in the contest preparation: because of some superstitions of authors, the prettinesses of problems cannot divide each other. In other words, if the prettinesses of chosen problems are x,y,zx,y,z, then xx should be divisible by neither yy, nor zz, yy should be divisible by neither xx, nor zz and zz should be divisible by neither xx, nor yy. If the prettinesses of chosen problems are xx and yy then neither xx should be divisible by yy nor yy should be divisible by xx. Any contest composed from one problem is considered good.

Your task is to find out the maximum possible total prettiness of the contest composed of at most three problems from the given pool.

You have to answer qq independent queries.

If you are Python programmer, consider using PyPy instead of Python when you submit your code.

Input

The first line of the input contains one integer qq (1≤q≤2⋅1051≤q≤2⋅105) — the number of queries.

The first line of the query contains one integer nn (1≤n≤2⋅1051≤n≤2⋅105) — the number of problems.

The second line of the query contains nn integers a1,a2,…,ana1,a2,…,an (2≤ai≤2⋅1052≤ai≤2⋅105), where aiai is the prettiness of the ii-th problem.

It is guaranteed that the sum of nn over all queries does not exceed 2⋅1052⋅105.

Output

For each query print one integer — the maximum possible cumulative prettiness of the contest composed of at most three problems from the given pool of problems in the query.

Example

input

Copy

3
4
5 6 15 30
4
10 6 30 15
3
3 4 6

output

Copy

30
31
10

#include<bits/stdc++.h>
 
using namespace std;
const int N = 2e5 + 10;
int a[N];
set<int> se;
 
int main()
{
	int t;
	scanf("%d",&t);
	while (t--)
	{
		int n;
		scanf("%d",&n);
		for (int i=0;i<n;i++)
		{
			int x;
			scanf("%d",&x);
			se.insert(x);
		}
		int cnt = 0,ans = 0;
		set<int>::iterator it;
		for (it=se.begin();it!=se.end();it++)
			a[++cnt] = *it;
		se.clear();
		for (int i=cnt;i>=1;i--)
		{
			ans = max(ans,a[i]);
			for (int j=cnt;j>i;j--)
			{
				if (a[j]%a[i]!=0)
				{
					ans = max(ans,a[j]+a[i]);
					for (int k=j-1;k>i;k--)
					{
						if (a[j]%a[k]!=0 && a[k]%a[i]!=0)
						{
							ans = max(ans,a[i]+a[j]+a[k]);
							break;
						}
					}
					break;
				}
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}