|All-time Popular Problems|
|Inorder Successor in BST|
|Maximum Product Subarray|
|Is Binary Number Multiple of 3|
|Pairwise swap elements of a linked list by swapping data|
|Largest Number formed from an Array|
|Reverse an Array|
|Boundary Traversal of binary tree|
|Leaders in an array|
You are given an integer N. You have to find 4 integers i,j,k,l less than equal to N such that lcm(i,j,k,l) is maximum.
First Line of input contains the number of test cases. Each line of the test case contains a single integer N.
Print the maximum lcm found.