primes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199]
T = int(input())

def gcd(x, y):
  if y == 0:
      return x
  return gcd(y, x % y)

for i in range(T):
  n = int(input())
  p = 1
  q = 1
  res = 1
  i = 0
  while res * primes[i] <= n:
    # print(primes[i])
    res = res * primes[i]
    p = p * primes[i]
    q = q * (1 + primes[i])
    i = i + 1  
  # print(p)
  # for j in range(i):
  #   q = q + p // primes[j]
  g = gcd(p, q)
  p = p // g
  q = q // g
  print("{}/{}".format(p, q))
  
  # 3 + 2 + 1 
  # 1/2 + 1/3 + 1/6

  # #
  # 3*5 + 2*5 + 2*3
  # 1/2 + 1/3 + 1/5