import math

def isprime(x):
    for i in range (2,10000):
        if i*i>x:
            return True
        if x % i ==0 :
            return False
    return True        
def solve(x):
    now=1
    p=1
    q=1
    for i in range(2,100000):
        if not isprime(i):
            continue
        if now*i > x:
            break
        now=now*i
        p=p*i
        q=q*(i+1)
    g=math.gcd(p,q)
    p=p//g
    q=q//g
    print(f"{p}/{q}")
    return None

T = int(input())
while T>0:
    T=T-1
    x=int(input())
    solve(x)