A site just for programming contests

Sanggeun has wanted to run a programming camp since he was a child. The first thing a camp needs is a place to hold it. Many people so far have given up on running one because they could not find a venue.

Sanggeun wants to buy a plot of land reserved for programming camps and settle the venue problem for everyone. Land prices in Seoul rise exponentially every year. If plot $i$ costs $L_i$ today, its price after $t$ years is $2 \times L_i^t$. All land prices are different, and Sanggeun can buy only one plot per year.

Sanggeun has $5 \times 10^6$ hundred million won, and he starts buying one year from now. (Nobody steals his money, he does not spend it on anything else, and he does not earn any more.) Given the current prices of the plots Sanggeun wants, write a program that finds the minimum cost of buying all of them.

For example, if the prices are 7, 2 and 10 and he buys them one per year in that order, the cost is $2 \times 7 + 2 \times 2^2 + 2 \times 10^3 = 2022$.

The first line contains the number of test cases $T$ ($1 \le T \le 10$). Each test case gives the land prices $L_i$, one per line, and a 0 marks the end of that test case. One test case has at most 40 plots. Every amount is in units of one hundred million won.

For each test case, print the minimum amount needed to buy every plot, in units of one hundred million won. If Sanggeun does not have enough money to buy them all, print Too expensive instead. He can buy every plot when the required amount is exactly the money he has.