You are given a blank square matrix of length n. You have to fill positive elements in the matrix such that Mat[i][j] should be divisible by i and j both[1 base index].

Now take out the maximum element formed in the matrix. 

You have to minimize this maximum value and report it.

INPUT

The first line contains a number T denoting the number of test-cases.

Each of the next T lines contains an integer n denoting the side of the square matrix.

OUTPUT

Print T lines each containing your minimised maximum element of the matrix.

CONSTRAINTS

1<=T<=10^5

1<=n<=10^9