Repovive

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/contests/4/problems/C

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/contests/4/problems/C

Repovive

You are given an integer array $a$ of length $n$ . Determine whether it is possible to partition the elements into two non-empty subsets $S_1$ and $S_2$ (each element goes to exactly one subset) such that:

$(\max(S_1) - \min(S_1)) = (\max(S_2) - \min(S_2))$

Note: A single-element subset has range $0$ (since $\max = \min$ ).

For each test case, output Yes if such a partition exists, otherwise output No.

Note: The judge is case-sensitive. Only exactly "Yes" or "No" will be accepted.

Constraints

$1 \le t \le 2 \times 10^5$
$2 \le n \le 2 \times 10^5$
$-10^9 \le a_i \le 10^9$
The sum of $n$ over all test cases does not exceed $2 \times 10^5$ .

t \\[0.5em] \left. \begin{array}{l} n \\ a_1 \quad a_2 \quad \cdots \quad a_n \end{array} \right\} \times t

\begin{array}{l} ans_1 \\ \vdots \\ ans_t \end{array}

Where each answer is exactly "Yes" or "No" (case-sensitive).

4C. Equal Range Partition

Constraints

Input

Output

Samples

Constraints