Permutation And Median

Given a sequence of $N$ elements, Chef defines a function $F(i)$ $(1 \leq i \leq N)$ as the median of the first $i$ elements of the sequence. Chef wants to get a *permutation* $P$ of length $N$ such that $P_i = F(i)$ $\forall$ $1 \leq i \leq N$. Can you help Chef in achieving this? Note that: - The *median* of a sequence is the middle element in the sorted order of the sequence. If $N$ is even,