Joey Loves Food.

0

0 votes
Easy-Medium
Problem

As we all know that Joey loves food but Monica is concerned about his health and thus refuses to give him any more food. But on Joey's requests she agrees to give him more food only if he solves this problem.

He is given an integer N and has to find 4 integers i,j,k,l less than equal to N such that lcm(i,j,k,l) is maximum.

We all know that Joey is not good at maths so you decide to help him out.

Input

First Line of input contains the number of test cases. Each line of the test case contains a single integer N.

Output

Print the maximum lcm found.

Constraints

1<=T<=5*10^4

4<=N<=5*10^4

Author - Hardik Gulati

Tester - Rishabh Jain

Time Limit: 1
Memory Limit: 256
Source Limit:
Editor Image

?