#include <bits/stdc++.h>
#define int long long

using namespace std;

class Fraction
{
  public:
    int a, b;
    static int sign(int x)
    {
        return (x > 0 ? 1 : -1);
    }
    Fraction() : a(0), b(1)
    {
    }
    Fraction(int x) : a(x), b(1)
    {
    }
    Fraction(int x, int y)
    {
        int m = __gcd(abs(x), abs(y));
        a = x / m * sign(y);
        if (a == 0)
            b = 1;
        else
            b = abs(y / m);
    }
    int get_denominator() const
    {
        return b;
    }
    int get_numerator() const
    {
        return a;
    }
    Fraction operator+(const Fraction &f) const
    {
        int m = __gcd(b, f.b);
        return {f.b / m * a + b / m * f.a, b / m * f.b};
    }
    Fraction operator-(const Fraction &f) const
    {
        int m = __gcd(b, f.b);
        return {f.b / m * a - b / m * f.a, b / m * f.b};
    }
    Fraction operator*(const Fraction &f) const
    {
        int m1 = __gcd(abs(a), f.b);
        int m2 = __gcd(b, abs(f.a));
        return {(a / m1) * (f.a / m2), (b / m2) * (f.b / m1)};
    }
    Fraction operator/(const Fraction &f)
    {
        return (*this) * Fraction(f.b, f.a);
    }
    friend ostream &operator<<(ostream &out, const Fraction &f)
    {
        if (f.a == 0)
            cout << 0;
        else if (f.b == 1)
            cout << f.a;
        else
            cout << f.a << '/' << f.b;
        return out;
    }
    bool operator<(const Fraction &that) const
    {
        return this->a * that.b < that.a * this->b;
    }
};

void solve()
{
    int t;
    cin >> t;
    int c = sqrt(2 * t);
    Fraction cc = c;
    Fraction tt = t;
    Fraction ans1 = tt / cc + (cc - 1) / 2;
    cc = c + 1;
    Fraction ans2 = tt / cc + (cc - 1) / 2;
    cout << min(ans1, ans2).a << " " << min(ans1, ans2).b << "\n";
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}