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 *
def IsPrime(n):
    k = 0
    for i in range(1,int(sqrt(n)) + 1):
        if n % i==0:k+=1
        if k + 1 > 2:
            return False
    return True
a = int(input())
for i in range(0,a):
    n = int(input())
    num = 0
    m = n
    while IsPrime(m) == False:
        m -= 1
    while IsPrime(n + 1) == False:
        n += 1
        num += 1
    a = n - 1
    b = 2 * ( n+1 )

    a = a * (n+1) * m - num * b
    b = b * (n+1) * m

    g = gcd( a, b)
    a //= g
    b //= g

    print( '{0}/{1}'.format(a,b))
