1633：【先！锋！题】Easy Problem

There are some positive integer numbers, and you want to divide them into two nonempty sets (every integer should be in and only in one set) and get a value descripted below:
Assume that set A has $n_1$ numbers $A_1,A_2,…,A_{n_1}$; set B has $n_2$ numbers $B_1,B_2,⋯,B_{n_2}$;
Let

Then

We want to know the largest ans.

The first line of the input is an integer T (T≤1000), which stands for the number of test cases you need to solve.
Every test case begins with an integer N (2≤N≤1000), then followed by N positive integers on the next line, these numbers will not exceed 1000