Min-Max Deque (Easy)

**This is the easy version of the problem. Here, there are no updates, i.e. $Q = 0$.** Consider an array $A$ of length $N$. $N$ is odd. Alice and Bob will play the following game on it: - Let $B$ be an initially empty array. - Alice and Bob take turns playing, with Alice going first. - On the $i$-th turn, the current player will choose element $A_i$, and insert it to either the beginning or the