B'Hossam woke up bored, so he decided to create an interesting array with his friend Hazem. Now, they have an array a of n positive integers, Hossam will choose a number a_i and Hazem will choose a number a_j . Count the number of interesting pairs (a_i, a_j) that meet all the following conditions: The input consists of multiple test cases. The first line contains a single integer t ( 1 <= t <= 100 ), which denotes the number of test cases. Description of the test cases follows. The first line of each test case contains an integer n ( 2 <= n <= 10^5 ). The second line of each test case contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^5 ). It is guaranteed that the sum of n over all test cases does not exceed 10^5 . For each test case print an integer -- the number of interesting pairs (a_i, a_j) . In the first example, the two ways are: In the second example, the four ways are: '...