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.
n = int(input())
def gcd(a,b):
    maxm = max(a,b)
    minm = min(a,b)
    if minm == 0:
        return maxm
    else:
        while(maxm%minm!=0):
            temp = maxm
            maxm = minm
            minm = temp%minm
        return minm
ans = 1
if n >= 3:
    if n%2!=0:
        ans = n*(n-1)*(n-2)
    else:
        k = gcd(n,n-3)
        if k==1:
            ans = n*(n-1)*(n-3)
        else:
            ans = n-1 * n-2 * n-3
elif n == 1:
    ans = 1
else:
    ans = 2
print(ans)