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.
def gcd(a,b):
    if a<b:
        a,b=b,a
    if b==0:
        return a 
    return gcd(b,a%b)


n=int(input())

if n<=2:
    print(n)
elif n==3:
    print(6)
else:
    if n%2==1:
        print(n*(n-1)*(n-2))
    else:
        ans=(n-3)*(n-2)*(n-1)
        if n>=51:
            for i in range(n-50,n):
                for j in range(i+1,n+1):
                    for k in range(j+1,n+1):
                        x=(i*j)//gcd(i,j)
                        x=(x*k)//gcd(x,k)
                        ans=max(ans,x)
        print(ans)