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 itertools

def gcd(a,b):
    if a<b:a,b=b,a
    while a%b!=0:
        a,b=b,a%b
    return b

def lcm(a,b):
    return a*b//gcd(a,b)


n=int(input())
if n<=2:
    print(0)
    quit()

f=list(itertools.combinations([i for i in range(max(1,n-50),n+1)], 3))

mx=0
for i in f:
    y=list(i)
    mx=max(mx,lcm(y[0],lcm(y[1],y[2])))

print(mx)