#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int t;
    cin >> t;

    auto solve = [&]() {
        // a + b, a^2 - ab + b^2
        // 3ab

        i64 n;
        cin >> n;

        vector<pair<i64, int>> factors;
        {
            i64 x = n;
            for (i64 i = 2; i * i <= x; i++) {
                if (x % i == 0) {
                    factors.emplace_back(i, 0);
                    while (x % i == 0) {
                        x /= i;
                        factors.back().second += 2;
                    }
                }
            }
            if (x > 1) {
                factors.emplace_back(x, 2);
            }
        }

        i64 x = -1, y = -1;
        constexpr i64 V = 1e6;

        auto rec = [&](auto rec, int i, i64 sum) -> void {
            if (sum >= 2 * V) {
                return;
            }
            if (i == int(factors.size())) {
                i64 pro = sum * sum - n * n / sum;
                if (pro <= 0 || pro % 3 != 0) {
                    return;
                }
                pro /= 3;

                i64 D = sum * sum - 4 * pro;
                if (D < 0) {
                    return;
                }

                i64 sq = sqrtl(D);
                if (sq * sq != D) {
                    return;
                }

                i64 a = sum - sq, b = sum + sq;
                if (a <= 0 || a % 2 != 0 || b % 2 != 0) {
                    return;
                }

                a /= 2, b /= 2;
                assert(a * a * a + b * b * b == n * n);
                x = a, y = b;

                return;
            }

            for (int j = 0; j <= factors[i].second; j++) {
                if (j > 0) {
                    sum *= factors[i].first;
                }
                rec(rec, i + 1, sum);
            }
        };
        rec(rec, 0, 1);

        if (x == -1) {
            cout << "impossible\n";
        } else {
            cout << x << ' ' << y << '\n';
        }
    };

    while (t--) {
        solve();
    }
    
    return 0;
}