#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 50000 + 5;

int qry[MAX_N];
char mark[MAX_N];
int pri[MAX_N], num[MAX_N], K[MAX_N], prod[MAX_N], cur[MAX_N], inv[MAX_N], pc;
char np[MAX_N];
vector <pair <int, int>> ans[MAX_N];

int exgcd(int a, int b, int &x, int &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    } else {
        int d = exgcd(b, a % b, y, x);
        y -= a / b * x;
        return d;
    }
}

int main() {
    int T;
    scanf("%d", &T);
    for (int i = 1; i <= T; i ++) {
        scanf("%d", qry + i);
        mark[qry[i]] = i;
    }
    int N = 50000;
    for (int i = 2; i <= N; i ++) {
        if (!np[i]) {
            pri[++ pc] = i;
            num[pc] = cur[pc] = i;
            while (1ll * num[pc] * i <= N) {
                num[pc] *= i;
            }
            prod[pc] = 1;
            for (int j = 1; j < pc; j ++) {
                prod[j] = 1ll * prod[j] * i % num[j];
                prod[pc] = 1ll * prod[pc] * cur[j] % num[pc];
            }
        }
        for (int j = 1; j <= pc && i * pri[j] <= N; j ++) {
            np[i * pri[j]] = 1;
            if (i % pri[j] == 0) break;
        }
        for (int j = 1; j <= pc; j ++) {
            if (1ll * pri[j] * cur[j] <= i) {
                cur[j] *= pri[j];
                for (int k = 1; k <= pc; k ++) {
                    if (k != j) prod[k] = 1ll * prod[k] * pri[j] % num[k];
                }
            }
        }
        if (mark[i]) {
            for (int j = 1; j <= pc; j ++) {
                // fprintf(stderr, "j = %d, p = %d, prod = %d\n", j, pri[j], prod[j]);
                int a = prod[j] % cur[j], b = cur[j], x, y;
                assert(exgcd(a, b, x, y) == 1);
                if (x < 0) x += b;
                ans[i].emplace_back(x, b);
            }
        }
    }
    for (int i = 1; i <= T; i ++) {
        if (qry[i] == 1) {
            printf("1/1\n");
            continue;
        }else if (qry[i] == 2) {
            printf("1/2\n");
            continue;
        }
        long double sum = 0;
        bool flag = false;
        for (auto [a, b] : ans[qry[i]]) {
            sum += (long double)a / b;
            if (flag) {
                putchar('+');
            }else {
                flag = true;
            }
            printf("%d/%d", a, b);
        }
        printf("-%d/1\n", (int)round(sum));
    }
    
    return 0;
}