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*
t = int(input())
arr = [0]*t
def snt(n):
    for i in range(2,int(sqrt(n))+1):
        if(n%i==0):
            return 0
    return 1
def ucln(a,b):
    while(a > 0 and b > 0):
        if(a > b):
            a=a%b
        else:
            b=b%a
    if(b > 0):
        return b
    return a
max = 0
tu = 0
mau = 1
for i in range(t):
    arr[i] = int(input())
    if(arr[i] > max):
        max = arr[i]
for i in range(2,max+1):
    tu1 = 1
    v1 = i
    while(snt(v1) == 0):
        v1-=1
    u1 = i + 1
    while(snt(u1) == 0):
        u1+=1
    mau1 = v1*u1
    tu = tu*mau1+tu1*mau
    mau = mau1*mau
    uc = ucln(tu,mau)
    tu = int(tu/uc)
    mau = int(mau/uc)
    for j in range(t):
        if(i == arr[j]):
            print(str(tu),'/',str(mau))