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):
    return int((a*b)/gcd(a,b))
n = int(input())
if(n<4):
    if(n == 1):
        print(1)
    elif(n==2):
        print(2)
    elif(n ==3):
        print(6)
elif(n&1):
    print(lcm(n-2,lcm(n,n-1)))
else:
    MAXL = 0
    third = -1
    for i in range(n-2, n-60, -1):
        x = lcm(i,n)
        if(x > MAXL):
            third = i
            MAXL = x
    ans = lcm(third, lcm(n, n-1))
    ans1 = lcm(n-1,lcm(n-2,n-3))
    print(max(ans,ans1))