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 *
n=int(input())
if n==3:
    print(6)
elif n==2:
    print(2)
elif n==1:
    print(1)
else:
    i=n-1
    while True:
        i-=1
        if gcd(n,i)==gcd(n-1,i)==1:
            break
    a=(n-1)*(n-2)*i
    for j in range(n,i+1,-1):
        for k in range(j-1,i,-1):
            for l in range(k-1,i-1,-1):
                b=j*k//gcd(j,k)
                b=b*l//gcd(b,l)
                a=max(a,b)
    print(a)