Median Minimization

JJ loves playing with medians. He has an array $A$ of length $N$ ($N$ is **odd**). He wants to partition the array $A$ into two **non-empty** subsets $P$ and $Q$ such that the value of $|median(P) - median(Q)|$ is as small as possible. (Note that each $A_i$ must belong to either subset $P$ or subset $Q$). Help him find this minimum value of $|median(P) - median(Q)|$. As a reminder, the median of