Let's assume that 
 -  *v*(*n*) is the largest prime number, that does not exceed *n*;-  *u*(*n*) is the smallest prime number strictly greater than *n*. 
Find <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/9efda33382293068ce21371b950297a1d3ac3212.png" style="max-width: 100.0%;max-height: 100.0%;"/>.
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<sup class="upper-index">9</sup>).
from math import gcd

def check(n):
    i = 2
    while i * i <= n:
        if n % 2 == 0:
            return False
        i += 1
    return True


for _ in range(int(input())):
    n = int(input())
    x = n + 1
    while check(x) is False:
        x += 1
    l = n
    while check(l) is False:
        l -= 1

    a, b = (x - 2) * l - 2 * (x - n - 1), 2 * x * l
    lol = gcd(a, b)
    a //= lol
    b //= lol
    print(str(a) + '/' + str(b))
