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 x1, x2, …, xt. For every , find two integers ni and mi (ni ≥ mi) such that the answer for the aforementioned problem is exactly xi if we set n = ni and m = mi.

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 xi (0 ≤ xi ≤ 109).

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

Output

For each test you have to construct, output two positive numbers ni and mi (1 ≤ mi ≤ ni ≤ 109) such that the maximum number of 1’s in a mi-free ni × ni matrix is exactly xi. 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

3
21
0
1

Output

5 2
1 1
-1

题目大意

给出一个n*n的矩阵，在其中任意找一个m*m的矩阵，
且使得为m*m的那个矩阵必须含有一个0，求最多能放多少个1。
给出1的个数，求上述的n与m。（special judge）

思路

其实这是一道数学题。
n*n肯定是要大于x的，则先枚举一下n。
则可以求出k（用所剩0来组成一个最大的正方形的边长）
则m=n/k;（如样例）
1 1 1 1 1
1 0 1 0 1
1 1 1 1 1
1 0 1 0 1
1 1 1 1 1
则用n*n减去（将n*n的矩阵分成m*m的矩阵个数）会等于1的个数。
若相等则有解，否则无解。

#include<cmath>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN=100000;
int ans,t;
long long x,m,n,k;
int main()
{
    scanf("%d",&t);
    while(--t>=0)
    {
        scanf("%lld",&x);
        for(n=1;n<=MAXN;n++)
            if(n*n>x)
            {
                k=int(sqrt(n*n-x));
                m=n/k;
                if(k&&(n+n/m)*(n-n/m)==x)
                {
                    ans=1;
                    printf("%lld %lld\n",n,m);
                    break;
                }
            }
        if(!ans)
            printf("-1\n");
        ans=0;
    }
}