#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


// a x + b y = (+/-) gcd(a, b)
//   (a, 0): g = a, x = 1, y = 0
//   (0, b), (b, b), (-b, b) (b != 0): g = b, x = 0, y = 1
//   otherwise: 2 |x| <= |b|, 2 |y| <= |a|
// S: signed integer
template <class S> S gojo(S a, S b, S &x, S &y) {
  if (b != 0) {
    const S g = gojo(b, a % b, y, x);
    y -= (a / b) * x;
    return g;
  } else {
    x = 1;
    y = 0;
    return a;
  }
}


/*
  \sum[i] x[i]/p[i]^e[i] \in \Z
  <=> ((\prod[j] p[j]^e[j]) / p[i]^e[i]) x[i] == 1  (mod p[i]^e[i])
*/

constexpr int N = 100;
int lpf[N];
int psLen;
int ps[N], qs[N];
Int ms[N], prods[N];

bool asked[N];
string ans[N];

int main() {
  int T;
  for (; ~scanf("%d", &T); ) {
    vector<int> Ns(T);
    for (int t = 0; t < T; ++t) {
      scanf("%d", &Ns[t]);
    }
    
    fill(asked, asked + N, false);
    for (int t = 0; t < T; ++t) asked[Ns[t]] = true;
    
    for (int p = 2; p < N; ++p) lpf[p] = p;
    psLen = 0;
    for (int p = 2; p < N; ++p) if (lpf[p] == p) {
      ps[psLen++] = p;
      for (int n = p; n < N; n += p) chmin(lpf[n], p);
    }
    for (int i = 0; i < psLen; ++i) {
      const int p = ps[i];
      int &q = qs[i];
      for (q = p; q <= N / p; q *= p) {}
      ms[i] = 1;
      prods[i] = 1;
    }
// cerr<<"qs = ";pv(qs,qs+psLen);
    for (int n = 2; n < N; ++n) {
      {
        const int p = lpf[n];
        int nn = n;
        do { nn /= p; } while (nn % p == 0);
        if (nn == 1) {
          for (int i = 0; i < psLen; ++i) {
            if (ps[i] == p) {
              ms[i] *= p;
            } else {
              (prods[i] *= p) %= qs[i];
            }
          }
        }
      }
      if (asked[n]) {
// cerr<<"n = "<<n<<endl;
        double sum = 0.0;
        for (int i = 0; i < psLen && ps[i] <= n; ++i) {
// cerr<<"  "<<prods[i]<<"^-1 mod "<<ms[i]<<endl;
          Int x, y;
          gojo(prods[i], ms[i], x, y);
          if ((x %= ms[i]) < 0) x += ms[i];
          sum += (double)x / ms[i];
          ans[n] += '+';
          ans[n] += to_string(x);
          ans[n] += '/';
          ans[n] += to_string(ms[i]);
        }
        const int x0 = -round(sum - 0.25);
        if (x0) ans[n] = to_string(x0) + "/1" + ans[n];
        if (ans[n][0] == '+') ans[n] = ans[n].substr(1);
      }
    }
    ans[1] = "1/1";
    
    for (int t = 0; t < T; ++t) {
      puts(ans[Ns[t]].c_str());
    }
  }
  return 0;
}