Minimum and Maximum

**This is an interactive problem.** There is a hidden sequence $A_1, A_2, \ldots, A_N$. You need to find indices of two smallest and two largest elements in it. Formally, you should find four integers $a$, $b$, $c$ and $d$ such that there is a permutation $P_1, P_2, \ldots, P_N$ of the integers $1$ through $N$ with the following properties: - for each $i$ ($1 \le i \lt N$), $A_{P_i} \le A_{P_{