SP1739 EQU2 - Yet Another Equation

Consider the equation > _x_ $ ^{2} $ - _n__y_ $ ^{2} $ = 1 where _n_ is some integer. Find the smallest strictly positive integer solutions (_x_, _y_) for a given _n_.

The number of test cases _t_ (around 30), followed by a list of _t_ values of _n_ (2 ≤ _n_ ≤ 1000). You can assume that the equation can be solved for all values of _n_ in the input set.

For every test case, the values of _x_ and _y_ separated by a space character, on separate lines.