#include <bits/stdc++.h>

using i64 = long long;

using i128 = __int128;
std::istream &operator>>(std::istream &is, i128 &n) {
    n = 0;
    std::string s;
    is >> s;

    for (auto c : s) {
        n = 10 * n + c - '0';
    }
    return is;
}
std::ostream &operator<<(std::ostream &os, i128 n) {
    if (n == 0) {
        return os << 0;
    }
    std::string s;
    while (n > 0) {
        s += '0' + n % 10;
        n /= 10;
    }
    std::reverse(s.begin(), s.end());
    return os << s;
}

i128 gcd(i128 a, i128 b) {
    return b ? gcd(b, a % b) : a;
}

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

    if (n == 2) {
        std::cout << "3 2\n";
        return;
    }

    i128 x = (n + 1) / 2, y = n - x;
    i128 num = x * x * (x + 1) + y * (x * (x + 1) + 2 * n);
    i128 den = x * n * 2;

    i128 g = gcd(num, den);
    num /= g;
    den /= g;

    std::cout << num << " " << den << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int T;
    std::cin >> T;

    while (T--) {
        solve();
    }

    return 0;
}