Problem Statement

The range of an array is defined as the difference between its maximum element and its minimum element.

You are given an integer array $a$ of length $n$. You may perform the following operation any number of times, including zero times:

• Choose two distinct indices $i$ and $j$ ($1\le i,j\le n$ and $i\ne j$), and update the array as follows:

Calculate the minimum possible range of $a$ after performing any finite number of operations.

Input Format

The input contains multiple test cases.

The first line contains an integer $T$ ($1 \le T \le 10^4$), the number of test cases.

For each test case:

• The first line contains an integer $n$ ($1 \le n \le 2 \times 10^5$), the length of the array $a$.
• The second line contains $n$ integers $a_1,a_2,\ldots,a_n$ ($-10^9 \leq a_i \leq 10^9$), the elements of $a$.

It is guaranteed that $\sum n \leq 2 \times 10^5$ over all test cases.

Output Format

For each test case, output one integer on a separate line: the minimum possible range after performing any finite number of operations.

Sample

Sample Input

3
1
5
2
0 2
4
-1 9 5 8

Sample Output

0
2
1

Explanation

• In the first test case, the array contains only one element, so its range is always $0$.