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.
# Recursive function to return gcd of a and b
def gcd(a,b):
    if a == 0:
        return b
    return gcd(b % a, a)
 
# Function to return LCM of two numbers
def lcm(a,b):
    return (a / gcd(a,b))* b
 
n=int(input())
if n<3:
    print(n)
else:
    op1=lcm(lcm(n,(n-1)),(n-2))
    op2=lcm(lcm(n,(n-2)),(n-3))
    op3=lcm(lcm(n,(n-2)),(n-2))
    op4=lcm(lcm(n,n),(n-2))
    op5=lcm(lcm(n,n),(n-1))
    op6=lcm(lcm(n,n),(n-3))
    ans=max(op1,op2,op3,op4,op5,op6)
    print(int(ans))
