Unskippable subway game

Sehun and Mina want to play a game using a subway map and a subway model.

The map shows only one line, and $N$ stations are connected in a row along it. The stations are numbered from $1$ to $N$ in order. For every integer $i$ with $1 \le i < N$, the station after station $i$ is station $i+1$. So the station after $1$ is $2$, the station after $2$ is $3$, $\cdots$, and the station after $N-1$ is $N$.

Every station except station $1$ and station $N$ is either a transfer station or a regular station. The starting station $1$ and the terminal station $N$ are always regular stations.

The rules of the game are as follows.

1. Place the subway model at station $1$.
2. Sehun goes first, and the two players take turns.
3. On each turn, a player moves the model to the next station one or more times, as many times as they like, and then passes the turn. However, if the model reaches a transfer station after a move, it cannot move any further. The turn passes to the opponent the moment the model arrives at a transfer station.
4. The player who places the model at station $N$ during their own turn wins.

Both players always make the best possible choice to win. Given the information about the subway line, write a program that finds the winner.

The first line contains the number of stations $N$. $(2 \le N \le 500\,000)$

The second line contains $N$ integers $A_1, \cdots, A_N$ separated by spaces, which describe each station. If station $i$ is a regular station, then $A_i = 0$. If it is a transfer station, then $A_i = 1$. $A_1$ and $A_N$ are always $0$.

On the first line, print mnx if Sehun wins, or alsdkffhgk if Mina wins.