Some days ago, I learned the concept of LCM (least common multiple). I've played with it for several times and I want to make a big number with it.

But I also don't want to use many numbers, so I'll choose three positive integers (they don't have to be distinct) which are not greater than *n*. Can you help me to find the maximum possible least common multiple of these three integers?
The first line contains an integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">6</sup>) — the *n* mentioned in the statement.
from math import gcd
def lcm(a,b,c):
    lcm1=(a*b)//gcd(a,b)
    ans=(lcm1*c)//gcd(lcm1,c)
    return ans
t=int(input())
for test in range(t):
    n=int(input())
    if n <= 2:
        print(n)
    else:
        if n%2==1:
            print(n*(n-1)*(n-2))
        else:
            init=0
            for i in range(max(1,n-5),n+1):
                for j in range(i,n+1):
                    for k in range(j,n+1):
                        ans=lcm(i,j,k)
                        if ans>init:
                            init=ans
            print(init)