Maximum Chocolates Tina and Rahul have got N bags of chocolates. Both of them love chocolates and want to get the maximum number of chocolates for themselves. So, they came up to an agreement of choosing chocolate bags. They will take the chocolate bags in turns. In each turn, one of them can choose one of the remaining bags and keep it with herself/himself. PrepBuddy wants to know the maximum number of chocolates that can Tina collect assuming that Tina takes the first turn. Input The first line contains an integer T , number of test cases. Then follows T test cases. Each test case consists of two lines. The first line contains N i.e total number of bags. Second lines contain N space-separated positive integers A[i] denote the number of chocolates in each bag.
Answers
Explanation:
Bad news came to Mike's village, some thieves stole a bunch of chocolates from the local factory! Horrible!
Aside from loving sweet things, thieves from this area are known to be very greedy. So after a thief takes his number of chocolates for himself, the next thief will take exactly k times more than the previous one. The value of k ( k > 1) is a secret integer known only to them. It is also known that each thief's bag can carry at most n chocolates (if they intend to take more, the deal is cancelled) and that there were exactly four thieves involved.
Sadly, only the thieves know the value of n, but rumours say that the numbers of ways they could have taken the chocolates (for a fixed n, but not fixed k) is m. Two ways are considered different if one of the thieves (they should be numbered in the order they take chocolates) took different number of chocolates in them.
Mike want to track the thieves down, so he wants to know what their bags are and value of n will help him in that. Please find the smallest possible value of n or tell him that the rumors are false and there is no such n.
Input
The single line of input contains the integer m (1 ≤ m ≤ 1015) — the number of ways the thieves might steal the chocolates, as rumours say.
Output
Print the only integer n — the maximum amount of chocolates that thieves' bags can carry. If there are more than one n satisfying the rumors, print the smallest one.
If there is no such n for a false-rumoured m, print - 1.
Examples
inputCopy
1
outputCopy
8
inputCopy
8
outputCopy
54
inputCopy
10
outputCopy
-1