Find the Modulus

The jury has a secret number $N$, where $1 \le N \le 10^{18}$. You want to know this number, and you are allowed to ask the jury some queries. In each query, you give the jury a number $X$ where $0 \le X \le 2 \cdot 10^{18}$, and the jury tells you $X \mod{N}$. Please find $N$ using at most **two** queries per test case. ### Interaction Format - The first line of contains $T$ - the number of te