938C. Constructing Tests

Let's denote a m-free matrix as a binary (that is, consisting of only 1's and 0's) matrix such that every square submatrix of size m × m of this matrix contains at least one zero.

Consider the following problem:

You are given two integers n and m. You have to construct an m-free square matrix of size n × n such that the number of 1's in this matrix is maximum possible. Print the maximum possible number of 1's in such matrix.

You don't have to solve this problem. Instead, you have to construct a few tests for it.

You will be given t numbers x₁, x₂, ..., x_t. For every , find two integers n_i and m_i (n_i ≥ m_i) such that the answer for the aforementioned problem is exactly x_i if we set n = n_i and m = m_i.

Input

The first line contains one integer t (1 ≤ t ≤ 100) — the number of tests you have to construct.

Then t lines follow, i-th line containing one integer x_i (0 ≤ x_i ≤ 10⁹).

Note that in hacks you have to set t = 1.

Output

For each test you have to construct, output two positive numbers n_i and m_i (1 ≤ m_i ≤ n_i ≤ 10⁹) such that the maximum number of 1's in a m_i-free n_i × n_i matrix is exactly x_i. If there are multiple solutions, you may output any of them; and if this is impossible to construct a test, output a single integer  - 1.

Example

Input

Copy

3
21
0
1

Output

5 2
1 1
-1

题意：在n*n的方阵中只有0或1，要求每个m*m大小的子方阵里至少有1个0

若1的个数最大为x，求合适的n和m;

思考：要想1的数量最大，则应该0的数量最小，那么何时最小呢？？？任何一个m*m的方阵里

只有1个0，总共(n/m)^2个0；0和1的数量一共n*n个

因此，应该满足n^2-(n/m)^2==x;

#include<bits/stdc++.h>
#define MAX 1e5+10
using namespace std;
typedef long long ll;
int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		ll x;
		scanf("%lld",&x);
		if(x==0) printf("1 1\n");
		else if(x==1) printf("-1\n");
		else{
			int flag=0;
			for(ll n=1;n<MAX;n++){
				if(n*n<=x) continue;  
				ll k=sqrt(n*n-x); //  k=n/m 且不可能为0 
				ll m=n/k;
				if(k>0&&n*n-(n/m)*(n/m)==x){
					flag=1;
					printf("%lld %lld\n",n,m);
					break;
				}	
			}
			if(!flag) printf("-1\n");
		}
		
	}
	return 0;
}