There's a circular subway line that contains n stations numbered 0 through n-1. The time to travel between stations 0 and 1 is t, the time to travel between stations 1 and 2 is t, ..., the time to travel between stations n-1 and 0 is t[n-1]. You can travel between stations in either direction, so there are always two ways to get from one station to another without visiting the same station more than once. For example, if there are 4 stations, the two ways of getting from station 1 to station 3 are 1-2-3 and 1-0-3. The total travel time in the first case is t + t, and in the second case, it is t + t. When a person needs to get from one station to another, she always chooses the faster of the two ways.
You are given a int t. Find two stations such that the fastest travel time between them is the maximal possible. Return this time.