Little Elephant and Rozdil

Description:

Input:

The first line contains a single integer n (1 ≤ n ≤ 10⁵) — the number of cities. The next line contains n integers, separated by single spaces: the i-th integer represents the time needed to go from town Rozdil to the i-th town. The time values are positive integers, not exceeding 10⁹.

You can consider the cities numbered from 1 to n, inclusive. Rozdil is not among the numbered cities.

Output:

Print the answer on a single line — the number of the town the Little Elephant will go to. If there are multiple cities with minimum travel time, print "Still Rozdil" (without the quotes).

Sample Input:

2
7 4

Sample Output:

2

Sample Input:

7
7 4 47 100 4 9 12

Sample Output:

Still Rozdil

Note:

In the first sample there are only two cities where the Little Elephant can go. The travel time for the first town equals 7, to the second one — 4. The town which is closest to Rodzil (the only one) is the second one, so the answer is 2.

In the second sample the closest cities are cities two and five, the travelling time to both of them equals 4, so the answer is "Still Rozdil".