Chef And Adjacent Sums

You are given an array $A$ of size $N$. Consider an array $B$ of size $N$ formed by sorting $A$ in non-decreasing order. Let $Z = (B_N + B_{(N-1)})$. Find whether there exists any rearrangement of the array $A$, such that, for all $(1\le i \lt N)$, $(A_i + A_{(i+1)}) \lt Z$. If such a rearrangement exists, print `YES`, otherwise print `NO`. ### Input - The first line of input will contai