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

n = int(input())

if n<=3:
    print([1,2,6][n-1])
else:
    n1 = n
    n2 = n - 1
    contribution = 1

    n3 = n - 2
    contribution = n3 // (gcd(n1,n3)*gcd(n2,n3))
    while n3 > contribution:
        contribution = max(contribution,n3 // (gcd(n1,n3)*gcd(n2,n3)))
        n3-=1

    print(n1*n2*contribution)





