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

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

if n == 1:
    print(1)
    exit()
if n == 2:
    print(2)
    exit()
if n & 1 == 1:
    print(n * (n - 1) * (n - 2))
    exit()
ret = 0
for a in range(max(n - 10, 1), n + 1):
    for b in range(a, n + 1):
        for c in range(b, n + 1):
            ret = max(ret, lcm(a, lcm(b, c)))
print(ret)