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.
from sys import setrecursionlimit
setrecursionlimit(100000000)


def comdivisor(a,b):
    if b == 0:
        return a
    return comdivisor(b, a%b)


n = int(input().strip())
if n <= 0:
    print(0)
if n == 1:
    print(1)
if n == 2:
    print(2)
if n > 2:
    k = comdivisor(n, n-1)
    lcm1 = n*(n-1)//k
    p = comdivisor(lcm1, n-2)
    lcm = lcm1*(n-2)//p
    print(lcm)