Given a array A of n integers (n > 1). Find the distance of the closest pair i.e. find the smallest value of |A_i-A_j| for i ≠ j.

Input

The first line of input consists of a single number t which determines the number of tests.

For each test case, the first line will be n and the second line will be n integers separated by spaces

Constraints

• 0 < t ≤ 10
• 1 < n ≤ 100000
• -2×10⁹ ≤ A_i ≤ 2×10⁹

Output

For each test case, print the distance of the closest pair.

Example

Input:
2
5
-2 -1 0 1 2
2
1 10

Output:
1
9