#include <bits/stdc++.h>
#define st first
#define nd second
using lint = long long;
constexpr int mod = 998244353;
constexpr int inf = 0x3f3f3f3f;
constexpr lint linf = 0x3f3f3f3f3f3f3f3f;
using namespace std;

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    vector<vector<int>>choose(23);
    for(int i=0;i<23;i++){
        choose[i] = vector<int>(i+1);
        choose[i][0] = choose[i][i] = 1;
        for(int j=1;j<i;j++) choose[i][j] = choose[i-1][j] + choose[i-1][j-1];
    }
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        int ind = 0;
        for(int i=1;i<23;i++){
            int k = *max_element(choose[i].begin(), choose[i].end());
            if(k > n) break;
            if(i >= n-i) break;
            ind = i;
        }
        for(int j=0;j<=ind;j++){
            if(j){
                if(j&1) cout<<"-";
                else cout<<"+";
            }
            cout<<choose[ind][j]<<"/"<<n-ind+j;
        }
        cout<<"\n";
    }



    return 0;
}