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

def lcm(a,b):
    return (a*b)//gcd(a,b)

n = int(input())
if(n<=2):
    print(n)
else:
    if(n%2!=0):
        print(n*(n-1)*(n-2))
    else:
        a=0
        for i in range(max(0,n-50),n-2):
            a = max(a,lcm(i,lcm(i+1,i+2)))
        print(a)
