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

n = int(input())
if n < 3: print(n)
elif n % 2 != 0: print(n*(n-1)*(n-2))
else: 
    m = n * (n-1)
    while not gcd(m, n) == 1:
        n -=1
    print(m*n)