Archers Game Winner Determination

In the archers' game, each archer is assigned a certain number of arrows. For any archer who is not positioned at the edge (i.e. not the first or the last), if the number of arrows assigned, denoted as \(a_i\), is strictly greater than the sum of the arrows of his two immediate neighbors (i.e. \(a_{i-1} + a_{i+1}\)), then the game state is considered Winner-less. Otherwise, the game is deemed Winnable.

Your task is to determine the state of the game by analyzing the sequence of arrow counts.

inputFormat

The input consists of two lines:

• The first line contains an integer \(n\) (with \(n \geq 3\)) representing the number of archers.
• The second line contains \(n\) space-separated integers where the \(i^{th}\) integer represents the arrow count \(a_i\) for the \(i^{th}\) archer.

outputFormat

Output a single word:

• Winner-less if there exists at least one archer (other than the first and the last) for whom \(a_i > a_{i-1} + a_{i+1}\).
• Winnable otherwise.

4
3 1 4 2

Winner-less