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 *
def lcm(arr,idx):
    if idx==len(arr)-1:
        return arr[idx]
    a=arr[idx]
    b=lcm(arr,idx+1)
    return ((a*b)//gcd(a,b))
n=int(input())
if n==1:
    print(1)
elif n==2:
    print(2)
else:
    ans=n*(n-1)
    for i in range(n-2,0,-1):
        curr=lcm([n,n-1,i],0)
        ans=max(ans,curr)
    ans2=(n-1)*(n-2)
    for i in range(n-3,0,-1):
        curr=lcm([n-1,n-2,i],0)
        ans2=max(ans2,curr)
    print(max(ans,ans2))