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 sys
import math as mt

input=sys.stdin.buffer.readline  
def lcm(a,b):
    return (a*b)//(mt.gcd(a,b))
#t=int(input())
t=1
for __ in range(t):
#    s=input()
    n=int(input())
    if n%2!=0:
        ans=(lcm(n,lcm(n-1,n-2)))
    else:
        ans=0
        for i in range(max(n-50,3),n+1):
        
            ans=max(ans,lcm(i,lcm(i-1,i-2)))
    if n==1:
        ans=1
    if n==2:
        ans=2
    if n==3:
        ans=6
    print(ans)    