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.
import sys
input = sys.stdin.readline
 
from math import gcd, isqrt, ceil
# from collections import deque
# import bisect #-->For bisect.bisect_left=lower_bound and bisect_right=upper_bound
# lcm(x, y) = x * y // gcd(x,y)
 
t = 1
t = int(input())
for _ in range(t):
    n = int(input())
    if (n == 1):
        print("1")
    elif (n == 2):
        print("2")
    elif (n == 3):
        print("6")
    else:
        if (n%2):
            print(n * (n - 1) * (n - 2))
        else:
            if (gcd(n,n-3) == 1):
                print(n * (n - 1) * (n - 3))
            else:
                print((n - 1) * (n - 2) * (n - 3))