Let's Go Hiking

A mountain range is represented by an array h of n distinct integers. The first player picks a starting position i that is NOT the global maximum. Then the second player makes the first move from position i. Players alternate moving the token to an adjacent position with a STRICTLY HIGHER value. A player who cannot move loses. Both players play optimally. Determine whether the first player can pick a starting position that guarantees a win.

Examples
Input: [5,[1,3,2,5,4]]
Output: true
Hints

Let's Go Hiking

A mountain range is represented by an array h of n distinct integers. The first player picks a starting position i that is NOT the global maximum. Then the second player makes the first move from position i. Players alternate moving the token to an adjacent position with a STRICTLY HIGHER value. A player who cannot move loses. Both players play optimally. Determine whether the first player can pick a starting position that guarantees a win.