B - Pseudo Palindrome

You are given an array $a$ of length $n$ and a non-negative integer $d$. Is it possible to rearrange $a$ in such a way that $|a_i - a_{n + 1 - i}| \le d$ for all $i$ ($1 \le i \le n$)? Here, $|x-y|$ denotes the absolute difference between $x$ and $y$. For example, $|3-1| = 2, |5-9| = 4, |6-6| = 0$. - Time Limit - 2 seconds - Memory Limit - 1.5GB ### Input - The first line of input will conta