Minimum Inversions

You are given \(T\) test cases. For each test case, you are provided with an integer \(n\) and an array of \(n\) integers. Your task is to determine the minimum number of inversions achievable by rearranging the array.

An inversion is defined as a pair \((i, j)\) such that \(i a_j\). Note that if you sort the array in non-decreasing order, the inversion count becomes \(0\), which is the minimum possible value. Hence, for every test case, the answer is \(0\).

Input Format: \(T\) test cases are given. For each test case, the first line contains an integer \(n\) and the second line contains \(n\) space-separated integers.

Output Format: For each test case, output a single integer \(0\) on a new line.

inputFormat

The first line of the input contains a single integer \(T\) (the number of test cases). Each test case consists of two lines. The first line contains an integer \(n\) (the size of the array). The second line contains \(n\) space-separated integers representing the elements of the array.

outputFormat

For each test case, output a single line containing the minimum number of inversions possible after rearranging the array (which is always \(0\)).

## sample

2
5
3 1 2 3 1
4
1 3 2 4

0
0

</p>