In computer science, a heap is a specialized tree-based data structure which is essentially an almost complete tree that satisfies the heap property: in a min heap, for any given node CC, if PP is a parent node of CC, then the key(the value) of PP is less than or equal to the key of CC. The node at the ``top'' of the heap(with no parents) is called the root node.
Usually, we may store a heap of size nn in an array h1,h2,…,hnh1,h2,…,hn, where hihi denotes the key of the ii-th node. The root node is the 11-th node, and the parent of the i(2≤i≤n)i(2≤i≤n)-th node is the ⌊i2⌋⌊i2⌋-th node.
Sunset and Elephant is playing a game on a min heap. The two players move in turns, and Sunset moves first. In each move, the current player selects a node which has no children, adds its key to this player's score and removes the node from the heap.
The game ends when the heap is empty. Both players want to maximize their scores and will play optimally. Please write a program to figure out the final result of the game.
Input
The first line of the input contains an integer T(1≤T≤10000)T(1≤T≤10000), denoting the number of test cases.
In each test case, there is one integer n(1≤n≤100000)n(1≤n≤100000) in the first line, denoting the number of nodes.
In the second line, there are nn integers h1,h2,...,hn(1≤hi≤109,h⌊i2⌋≤hi)h1,h2,...,hn(1≤hi≤109,h⌊i2⌋≤hi), denoting the key of each node.
It is guaranteed that ∑n≤106∑n≤106.
Output
For each test case, print a single line containing two integers SS and EE, denoting the final score of Sunset and Elephant.