On Sum of Fractions

Description:

Input:

The first line contains integer t (1 ≤ t ≤ 500) — the number of testscases.

Each of the following t lines of the input contains integer n (2 ≤ n ≤ 10⁹).

Output:

Print t lines: the i-th of them must contain the answer to the i-th test as an irreducible fraction "p/q", where p, q are integers, q > 0.

Sample Input:

2
2
3

Sample Output:

1/6
7/30