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>).
import math
def prime(n):
    root = int(math.sqrt(n))
    i=2
    while(i<=root):
        if(n%i==0):
            print(i)
            return 0
        i+=1
    return 1
def diviseur(num):
    root = int(math.sqrt(num))
    i = 2
    div = []
    while(i < root):
        if(num % i == 0):
            div.append(i)
            num /= i
            while(num % i == 0):
                num /= i
        i += 1
    return div
def reduc(a,b):
    div1 = diviseur(a)
    div2 = diviseur(b)
    l = []
    for i in div1:
        if i in div2:
            l.append(i)
    for i in l:
        a /= i
        b /= i
    return a,b
nb = int(input())
for i in range(nb):
    l = []
    a = int(input())
    for x in range(2,a+1):
        vn = x
        for j in range(x,1,-1):
            if(prime(j)==1):
                vn = j
                break
        x+=1
        un = x
        while(1):
            if(prime(x)==1):
                un = x
                break
            x+=1
        l.append(un*vn)
    prod = 1
    for i in l:
        prod *= i
    summ = 0
    for i in range(len(l)):
        summ += prod / l[i]
    summ,prod = reduc(summ,prod)
    print(str(int(summ))+"/"+str(int(prod)))