#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
const int mod = 998244353;

struct node // 分数
{
    int a, b;
    node() {}
    node(int a, int b) : a(a), b(b) {}

    // 乘法
    node operator*(const node &x) const
    {
        return {a * x.a, b * x.b};
    }

    // 加法
    node operator+(const node &x) const
    {
        if (b == 0)
            return x;
        if (x.b == 0)
            return *this;
        return {a * x.b + x.a * b, b * x.b};
    }

    // 约分
    void reduce()
    {
        int g = __gcd(a, b);
        a /= g;
        b /= g;
    }

    // 输出
    friend ostream &operator<<(ostream &out, const node &x)
    {
        out << x.a << " " << x.b;
        return out;
    }
} a;

void solve()
{
    int n;
    cin >> n;

    int t = (n * (n + 1) / 2 + (n - 1)) / n;
    int len = (n * (n + 1) / 2 + (n - 1)) / n;
    // cout << "len = " << len << endl;

    // cout << len << " " << n << endl;

    node x = node({len * (len + 1) / 2, 1 * n});
    node y = node({(n - len) * (n + 3), 2 * n});
    // cout << x << endl
    //      << y << endl;
    x.reduce();
    y.reduce();

    a = x + y;
    // cout << t << endl;
    a.reduce();

    cout << a << endl;
}

signed main()
{
    cin.tie(0)->ios::sync_with_stdio(false);

    int t = 1;
    cin >> t;
    while (t--)
        solve();

    return 0;
}