**Problem Description**

**Input**

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.

**Output**

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).

**Sample Input**

3 5 1 2 3 4 5 5 4 5 1 2 3 5 1 1 2 2 3

**Sample Output**

1 3 No Town

**Source**

2018绍兴市联赛