#include<bits/stdc++.h>
#define F(i, a, b) for(int i = a; i <= b; i ++)

using namespace std;


const int M = 1e4 + 10;
vector<int>pri;
bool vst[M];

vector<int>n;
vector<int> operator * (const vector<int>a, int b)
{
    int m = a.size(); vector<int>c(m);
    for (int i = 0; i < m; i ++)c[i] = a[i] * b;
    for (int i = 0; i < m - 1; i ++)
    {
        c[i + 1] += c[i] / 10;
        c[i] %= 10;
    }
    while (c[m - 1] >= 10) {c.push_back(c[m - 1] / 10); c[m - 1] %= 10; m ++;}
    return c;
}
bool operator > (const vector<int>b, const vector<int>a)
{
    int n = a.size(), m = b.size();
    if (n > m) return 0;
    if (n < m) return 1;
    for (int i = n - 1; i >= 0; i --)
    {
        if (a[i] < b[i]) return 1;
        if (a[i] > b[i]) return 0;
    }
    return 0;
}

void pre(int n)
{
    for (int i = 2; i <= n; i ++)
    {
        if (!vst[i]) {pri.push_back(i);}
        for (int x : pri)
        {
            if (1LL * i * x > n) break;
            vst[i * x] = 1;
            if (i % x == 0)break;
        }
    }
}
void sol() 
{
    string s;
    cin >> s;
    int len = s.length();
    for (int i = len - 1; i >= 0; i --)n.push_back(s[i] - '0');
    vector<int>v = {1};
    multiset<int>a, b;
    for (int x : pri)
    {
        vector<int>tv = v * x;
        if (tv > n) break;
        v = tv;
        a.insert(x); b.insert(x + 1);
    }
    

    vector<int>g;
    for (int x : a)
    {
        for (int y : b)
        {
            if (y % x == 0)
            {
                g.push_back(x);
                b.erase(b.find(y)); b.insert(y / x);
                break;
            }
        }
    }
    for (int x : g)a.erase(x);

    vector<int>ta = {1}, tb = {1};
    for (int x : a) ta = ta * x;
    for (int y : b) tb = tb * y;
    int p = ta.size(), q = tb.size();
    for (int i = p - 1; i >= 0; i --) cout << ta[i];
    cout << '/';
    for (int i = q - 1; i >= 0; i --) cout << tb[i];
    cout << '\n';

    n.clear();
}
 
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    pre(10000);
    int t; cin >> t;
    F(i, 1, t) sol();
    return 0;
}