The chef has one array of N natural numbers (might be in sorted order). Cheffina challenges chef to find the total number of inversions in the array.

-----Input:-----
- First-line will contain $T$, the number of test cases. Then the test cases follow. 
- Each test case contains two lines of input, $N$.
- N space-separated natural numbers. 

-----Output:-----
For each test case, output in a single line answer as the total number of inversions.

-----Constraints-----
- $1 \leq T \leq 10$
- $1 \leq N \leq 10^5$
- $1 \leq arr[i] \leq 10^5$

-----Sample Input:-----
1
5
5 4 1 3 2

-----Sample Output:-----
8

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "# cook your dish here\ndef mergeSort(arr, n): \n    # A temp_arr is created to store \n    # sorted array in merge function \n    temp_arr = [0]*n \n    return _mergeSort(arr, temp_arr, 0, n-1) \n  \n# This Function will use MergeSort to count inversions \n  \ndef _mergeSort(arr, temp_arr, left, right): \n  \n    # A variable inv_count is used to store \n    # inversion counts in each recursive call \n  \n    inv_count = 0\n  \n    # We will make a recursive call if and only if \n    # we have more than one elements \n  \n    if left < right: \n  \n        # mid is calculated to divide the array into two subarrays \n        # Floor division is must in case of python \n  \n        mid = (left + right)//2\n  \n        # It will calculate inversion  \n        # counts in the left subarray \n  \n        inv_count += _mergeSort(arr, temp_arr,  \n                                    left, mid) \n  \n        # It will calculate inversion  \n        # counts in right subarray \n  \n        inv_count += _mergeSort(arr, temp_arr,  \n                                  mid + 1, right) \n  \n        # It will merge two subarrays in  \n        # a sorted subarray \n  \n        inv_count += merge(arr, temp_arr, left, mid, right) \n    return inv_count \n  \n# This function will merge two subarrays  \n# in a single sorted subarray \ndef merge(arr, temp_arr, left, mid, right): \n    i = left     # Starting index of left subarray \n    j = mid + 1 # Starting index of right subarray \n    k = left     # Starting index of to be sorted subarray \n    inv_count = 0\n  \n    # Conditions are checked to make sure that  \n    # i and j don't exceed their \n    # subarray limits. \n  \n    while i <= mid and j <= right: \n  \n        # There will be no inversion if arr[i] <= arr[j] \n  \n        if arr[i] <= arr[j]: \n            temp_arr[k] = arr[i] \n            k += 1\n            i += 1\n        else: \n            # Inversion will occur. \n            temp_arr[k] = arr[j] \n            inv_count += (mid-i + 1) \n            k += 1\n            j += 1\n  \n    # Copy the remaining elements of left  \n    # subarray into temporary array \n    while i <= mid: \n        temp_arr[k] = arr[i] \n        k += 1\n        i += 1\n  \n    # Copy the remaining elements of right  \n    # subarray into temporary array \n    while j <= right: \n        temp_arr[k] = arr[j] \n        k += 1\n        j += 1\n  \n    # Copy the sorted subarray into Original array \n    for loop_var in range(left, right + 1): \n        arr[loop_var] = temp_arr[loop_var] \n          \n    return inv_count \n    \nfor _ in range(int(input())):\n    n = int(input())\n    a = list(map(int,input().split()))\n    print(mergeSort(a, n) )"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 13449