from fractions import Fraction

h = 100000
primes = []
minp = [0]*(h+1)
for i in range(2, h+1):
    if minp[i] == 0:
        primes.append(i)
        minp[i] = i
    for p in primes:
        if i*p > h: break
        minp[i*p] = p
        if p == minp[i]: break

def solve():
    n = int(input())
    u, d = 1, 1
    for p in primes:
        if u*p > n: break
        u *= p
        d *= (p+1)
    ans = Fraction(u, d)
    print(str(ans.numerator) + '/' + str(ans.denominator))

for _ in range(int(input())):
    solve()