#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
#include <atcoder/modint>
using mint = atcoder::modint998244353;
#include "po167_library/math/Binomial.hpp"
po167::Binomial<mint> table;
//a*x+b*y=gcd(a,b)となるx,yにする 返り値gcd(a,b)
ll Euclid(ll a,ll b,ll &x,ll &y){
if(b==0){
x=1,y=0;
return a;
}
ll d=Euclid(b,a%b,y,x);
y-=a/b*x;
return d;
}
//a以下の素数を列挙、計算量:Nlog(log(N))
vector<long long> Eratosthenes(long long a){
if(a<2) return {};
vector<long long> p(a+1),ans;
p[0]=1,p[1]=1;
long long k=2;
while(k*k<=a){
if(p[k]==0){
ans.push_back(k);
for(long long i=2;i*k<=a;i++){
p[i*k]=1;
}
}
k++;
}
while(k<=a){
if(p[k]==0) ans.push_back(k);
k++;
}
return ans;
}
void solve();
// CITRUS CURIO CITY / FREDERIC
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
// cin >> t;
rep(i, 0, t) solve();
}
void solve(){
const int LIM = 50000;
auto E = Eratosthenes(LIM);
vector<int> P(E.size());
vector<int> upd(LIM + 1, -1);
vector<int> Q(E.size(), 1);
int Eind = 0;
for (auto x : E){
ll tmp = 1;
while (true){
tmp *= x;
if (tmp > LIM) break;
upd[tmp] = Eind;
P[Eind] = tmp;
}
Eind++;
}
int T;
cin >> T;
struct query {
int N;
int ind;
};
vector<query> NS(T);
rep(i, 0, T){
cin >> NS[i].N;
NS[i].ind = i;
}
sort(all(NS), [&](query l, query r){
return l.N < r.N;
});
vector<vector<pair<int, int>>> ans(T);
vector<mint> inv_lcm(T);
vector<ll> val(Eind, 1);
int ans_ind = 0;
mint base_lcm = 1;
rep(i, 1, LIM + 1){
if (upd[i] != -1){
int prim = E[upd[i]];
base_lcm *= table.inv(prim);
Q[upd[i]] *= prim;
rep(j, 0, Eind) if (j != upd[i]){
val[j] = (val[j] * prim) % P[j];
}
}
while (ans_ind != T && NS[ans_ind].N == i){
auto q = NS[ans_ind++];
inv_lcm[q.ind] = base_lcm;
if (i == 1){
continue;
}
rep(j, 0, Q.size()) if (Q[j] != 1){
ans[q.ind].emplace_back(val[j] % Q[j], Q[j]);
}
}
}
rep(i, 0, T){
if (ans[i].empty()){
cout << "1/1\n";
continue;
}
mint tmp = inv_lcm[i] * -1;
rep(j, 0, ans[i].size()){
if (j) cout << "+";
ll x, y;
assert(Euclid(ans[i][j].first, ans[i][j].second, x, y) == 1);
x = (x + ans[i][j].second) % ans[i][j].second;
cout << x << "/" << ans[i][j].second;
tmp += (mint)(x) * table.inv(ans[i][j].second);
}
if (tmp.val() != 0) cout << "-" << tmp.val() << "/1\n";
else cout << "\n";
}
}