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>).
def NroDivisores(n):
    divisores=0
    contador=1
    while(contador<=n):
        if(n%contador==0):
            divisores=divisores+1
        contador=contador+1
    return divisores

def HallarprimoMa(n):
    n=n+1
    while(NroDivisores(n)>2):
        n=n+1
    return n

def HallarprimoMe(n):
    while(NroDivisores(n)>2):
        n=n-1
    return n

def mdc(a,b):
    resto=a%b
    while(resto>0):
        a=b
        b=resto
        resto=a%b
    return b

#programa principl
np=int(input())
cont=0
while(cont<np):
    m=int(input())
    n=1
    d=6
    contador=2
    while(contador<m):
        nn=1
        dn=HallarprimoMe(contador+1)*HallarprimoMa(contador+1)
        n=n*dn+d*nn
        d=d*dn
        contador=contador+1
    md=mdc(n,d)
    nf=n//md
    df=d//md
    print(nf,"/",df)
    cont=cont+1
