Not Divisible

You are given an array $A$ consisting of $N$ **distinct** positive integers. Find the **smallest** positive integer $d$ such that there exists **no** pair of integers $(i, j)$ $(1\le i\lt j \le N)$ where $abs(A_i - A_j)$ is divisible by $d$. In other words, $d \nmid abs(A_i - A_j)$ for all $(1\le i \lt j\le N)$. ### Input - The first line of input will contain a single integer $T$, denoting th