Tom wants to go from his town to some other town to live. But he does not like to spend too much time on his journey. So he will go to the nearest town such that he just needs minimum time on journey. If there are multiple such towns, then Tom won't go anywhere.

The first line is a positive integer T (T<=20), which represents the number of cases.

For each case, the first line contains a single integer n (1 ≤ n ≤ 100,000) — the number of towns. The second line contains n integers: the i-th integer represents the time needed to go to the i-th town. The time values are positive integers, not exceeding 1,000,000,000.

You can consider the towns numbered from 1 to n.

For each case, print the answer on a single line — the number of the town Tom will go to. If there are multiple towns with minimum time, print "No Town" (without the quotes).