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 checkp(x):
    d = 2
    while d * d <= x:
        if x % d == 0:
            return False
        d += 1
    return True


for i in range(int(input())):
    n = int(input())
    p = n
    while not checkp(p):
        p -= 1
    q = n + 1
    while not checkp(q):
        q += 1
    
    a = p*q - 2*q - 2*p + 2*n+2
    b = 2 * p * q
    g = gcd(a, b)
    a //= g
    b //= g
    print(a, b, sep='/')