Let us calculate the time it is required to go from station ~1~ to station ~x~. Let us store those values in the array ~a~. Obviously, from station ~1~ to station ~1~ we need ~0~ minutes. For any other station ~x > 1~:

• If the information about the station is Patrik ~t_i~, then ~a_x = t_x~
• If the information about the station is Josip ~y~ ~t_i~, then ~a_x = a_y+t_x~ (the time it took from ~1~ to ~y~ plus the time it took from ~y~ to ~x~)

This will help us in finding the shortest ride. The shortest ride will always be on adjacent stations, so the indices will be ~x~ and ~x+1~. For some station ~x~, the time it is required to go from ~x~ to ~x+1~ is ~a_{x+1}-a_x~ (if we subtract the time it took from ~1~ to ~x~, from the time it took from ~1~ to ~x+1~, we will get the time it took from ~x~ to ~x+1~), now we just need to go through the sequence and find the ~x~ for which that time is the smallest.