//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
pair<ll,ll> solve(ll n)
{
	if(!n) return mp(1,2);
	if(n%4==0)
	{
		auto pr=solve(n/2);
		pr.first*=2;
		pr.second*=2;
		return pr;
	}
	else
	{
		auto pr=solve(n/2-1);
		pr.first*=2;
		pr.second*=2;
		pr.first++;
		pr.second--;
		return pr;
	}
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		ll n;
		cin>>n;
		if(n%2)
			cout<<"-1\n";
		else
		{
			auto pr=solve(n);
			assert(pr.first+pr.second==((pr.first)^(n+pr.second)));
			cout<<pr.first<<" "<<pr.second<<'\n';
		}
	}
	return 0;
}