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 math
def LCM(a,b):
    res=int((a*b)/math.gcd(a,b))
    return res
a=int(input())
ans=0
if(a==1):
    ans=1
elif(a==2):
    ans=2
elif(a%2==0):
    b1=(a-1)*(a-2)*(a-3)
    b2=a*(a-1)*(a-3)
    if(math.gcd(a,a-3)>math.gcd(a,a-2)):
        ans=b1
    else:
        ans=b2

elif(a%2==1):
    ans=a*(a-1)*(a-2)
print(ans)
