There are (n) slimes on a line, where slime (i) is at position (a_i) on the line. You will perform the following operation some number of times (possibly none): select an integer (x), then for each (j) ((1 \le j \le n)): if (a_j \lt x) then do (a_j := a_j + 1). if (a_j \gt x) then do (a_j := a_j - 1). if (a_j = x) then do nothing. if (a_j \lt x) then do (a_j := a_j + 1). if (a_j \gt x) then do (a_j := a_j - 1). if (a_j = x) then do nothing. Determine the minimum number of operations to make all slimes occupy the same position. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 100)). The description of the test cases follows. The first line of each testcase contains an integer (n) ((2 \le n \le 1000)) — the number of slimes. The second line of each testcase contains (n) integers (a_1,a_2,\ldots,a_{n}) ((1 \le a_i \le 1000)) — the initial positions of the slimes. It is guaranteed that the sum of (n) over all test cases does not exceed (1000). For each testcase, output the minimum number of operations required to make all slimes occupy the same position. Test Case 1: We can perform (2) operations, both with (x = 3). The first operation updates the array of positions to (a = 2, 3, 3, 3, 4), and then the second operation updates it to (a = 3, 3, 3, 3, 3). Test Case 2: All the slimes are already at position (3), and hence (0) operations are needed.