#include <bits/stdc++.h>

using i64 = long long;
int dp[64][2][2];
std::tuple<int, int, int, int> pre[64][2][2];

void solve(){
    memset(dp, 0, sizeof(dp));
    i64 n;
    std::cin >> n;
    dp[0][0][0] = 1;
    for (int i = 0; i < 60; i += 1) {
        int c = n >> i & 1;
        for (int j = 0; j < 2; j += 1) {
            for (int k = 0; k < 2; k += 1) {
                if (!dp[i][j][k]) continue;
                for (int p = 0; p < 2; p += 1) {
                    for (int q = 0; q < 2; q += 1) {
                        if ((p + q + j) % 2 != (p ^ ((c + q + k) % 2))) {
                            continue;
                        }
                        dp[i + 1][(p + q + j) / 2][(c + q + k) / 2] = dp[i][j][k];
                        pre[i + 1][(p + q + j) / 2][(c + q + k) / 2] = {p, q, j, k};
                    }
                }
            }
        }
    }
    if (!dp[60][0][0]) {
        std::cout << -1 << "\n";
        return;
    }
    i64 a = 0, b = 0;
    int cur = 60;
    int j = 0, k = 0;
    while(cur) {
        auto [p, q, jj, kk] = pre[cur][j][k];
        a |= (i64)p << (cur - 1);
        b |= (i64)q << (cur - 1);
        j = jj;
        k = kk;
        cur -= 1;
    }
    std::cout << a << " " << b << "\n";
    // assert((a + b) == (a ^ (b + n)));
    // assert((a < (1ll << 60)) && (b < (1ll << 60)));
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int T;
    std::cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}