You are given an array (a) of (n) positive integers. Alice and Bob will play a game with this array. They will take alternating turns, with Alice going first. At each turn, the player must choose a value (x>0) that appears in (a) at least once. Then, the player earns (1) point for each value (x) in the array, each value (x) in the array is decreased by (1) and becomes (x-1). The game ends when no (x) can be chosen; that is, when all the elements in the array are zero. Given that both players want to maximize their points and play optimally, calculate the amount of points that each player will end up with. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^3)). The description of the test cases follows. The first line of each test case contains an integer (n) ((1 \leq n \leq 2\cdot 10^{5})) — the size of the array. The second line contains (n) integers (a_1, a_2, \ldots, a_n) ((1 \leq a_i \leq 10^{9})) — the elements of the array. It is guaranteed that the sum of (n) over all test cases does not exceed (2\cdot 10^{5}). For each test case, output two integers, the amount of points Alice and Bob will get if both play optimally. Visualizer link In the first test case, Alice chooses (x=1) with her first move. The array becomes (2,0,0) and she earns (2) points. After that, Bob is forced to choose (x=2). The array becomes (1,0,0) and Bob earns (1) point. Finally, Alice is forced to choose (x=1) and earn one more point. After that, the array is (0,0,0), so the game ends. In total, Alice finishes with (3) points and Bob with (1) point. In the third test case, each player will decrement all the elements and earn (4) points each move. Alice will earn (5 \cdot 4 = 20) points while Bob will only earn (4\cdot 4 = 16) points.