MOD = 998244353

primes = []
sieve = [1] * 50001
ZZ = 50000
for p in range(2,ZZ+1):
    if sieve[p] != 1:
        continue
    q = p*p
    while q <= ZZ:
        sieve[q] = 0
        q += p
for p in range(2,ZZ+1):
    if sieve[p] == 1:
        primes.append(p)

T = int(input())
for t in range(T):
    N = int(input())
    if N == 1 :
        print("1/1")
        continue
    A = []
    for p in primes:
        if p <= N:
            q = p
            while q*p <= N:
                q*=p
            A.append(q)
    N = len(A)
    X = [-1]*N
    Y = [-1]*N
    for i in range(N-1) :
        X.append(i*2)
        Y.append(i*2+1)
    n = len(X)
    Z = [0] * n
    Z[-1] = 1
    for i in range(N,n):
        A.append(A[X[i]] * A[Y[i]])
    for i in range(n-1,N-1,-1):
        Z[X[i]] = Z[i] * A[Y[i]] % A[X[i]]
        Z[Y[i]] = Z[i] * A[X[i]] % A[Y[i]]
    # print(Z)
    # print(A)
    Q = [pow(Z[i],-1,A[i]) for i in range(N)]
    
    f = 0
    g = 1
    for i in range(N):
        a = pow(A[i],-1,MOD)
        f = (f+a*Q[i])%MOD
        g = g*a%MOD
    p = (f-g)%MOD
    for i in range(N):
        if i+p>=N :
            print(Q[i]-A[i], end="")
        else:
            if i != 0:
                print("+",end="")
            print(Q[i],end="")
        print("/",end="")
        print(A[i],end="")
    print("")