#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<map>
#include<math.h>
const long long inf=1e17;
#define forn(i,n) for(int i=0;i<n;i++)
#define ll long long
using namespace std;
ll mod=pow(10,9)+7;
int main()
{
int t;
ll x,n,p;
scanf("%d",&t);
while(t--)
{
scanf("%lld",&x);
n=ceil((-1+sqrt(8*x+1))/2);
p = x - n*(n-1)/2;
if (n%2==0)
printf("TERM %lld IS %lld/%lld\n",x , p , n+1-p);
else
printf("TERM %lld IS %lld/%lld\n",x, n + 1 -p ,p);
}
return 0;
}
I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGU8c3RyaW5nLmg+CiNpbmNsdWRlPGlvc3RyZWFtPgojaW5jbHVkZTxhbGdvcml0aG0+CiNpbmNsdWRlPG1hcD4KI2luY2x1ZGU8bWF0aC5oPgpjb25zdCBsb25nIGxvbmcgaW5mPTFlMTc7CgojZGVmaW5lIGZvcm4oaSxuKSBmb3IoaW50IGk9MDtpPG47aSsrKQojZGVmaW5lIGxsIGxvbmcgbG9uZwp1c2luZyBuYW1lc3BhY2Ugc3RkOyAKbGwgbW9kPXBvdygxMCw5KSs3OyAKaW50IG1haW4oKQp7IAoJaW50IHQ7IAoJbGwgeCxuLHA7IAoJc2NhbmYoIiVkIiwmdCk7IAoJd2hpbGUodC0tKQoJeyAKCQkKCQlzY2FuZigiJWxsZCIsJngpOwogICAgICAgIG49Y2VpbCgoLTErc3FydCg4KngrMSkpLzIpOwogICAgICAgIHAgPSB4IC0gbioobi0xKS8yOwogICAgICAgIGlmIChuJTI9PTApCiAgICAgICAgICAgIHByaW50ZigiVEVSTSAlbGxkIElTICVsbGQvJWxsZFxuIix4ICwgcCAsIG4rMS1wKTsgICAgCiAgICAgICAgZWxzZQogICAgICAgICAgICBwcmludGYoIlRFUk0gJWxsZCBJUyAlbGxkLyVsbGRcbiIseCwgbiArIDEgLXAgLHApOyAgIAoJfSAKCXJldHVybiAwOyAKfQ==