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.
#code
import math as m

def lcm(a, b):
    return (a*b)//(m.gcd(a, b))

n = int(input())

var = m.gcd(n, n - 1)

mx = 0

if(n == 1):
    print(1)
elif(n == 2):
    print(2)
elif(n == 3):
    print(6)
elif(n == 4):
    print(12)
else:
    for i in range(0, min(100, n)):
        for j in range(0, min(100, n)):
            for k in range(0, min(100, n)):
                mx = max(mx, lcm(n - i,lcm(n - j, n - k)))
print(mx)