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,s):
    if a==0:
        return s 
    return gcd(s%a,a)
def lcm(a,s):
    return (a*s)//gcd(a,s)
def challenge(n):
    if n==1:
        return 1
    a=lcm(n,n-1)
    return lcm(a,n-2)
n=int(input())
print(challenge(n))

