def gcd(x, y):
    if x == 0: return y
    if y == 0: return x
    return gcd(x, y%x) if x < y else gcd(y, x%y)

def sum(n):
    return n*(n+1)/2
T=int(input())
while T:
    n=int(input())
    sm=int(sum(n))
    if(n*n-n<=sm):
        d=gcd(sm,n)
        sm//=d
        n//=d
        print(sm,n)
    else:
        x=int(sm//n+1)
        ans=int(n*sum(x))
        ans+=(sm+n)*(n-x)
        n=n*n
        d=int(gcd(ans,n))
        ans=ans//d
        n=n//d
        print(ans,n)