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 fractions import gcd
def lcm(a, b, c):
    ab = a * b // gcd(a, b)
    return ab * c // gcd(ab, c)
def lcm_n(a):
    return lcm(max(a, 1), max(a - 1, 1), max(a - 2, 1))
n = int(input())
print(max(lcm_n(n), lcm_n(n - 1)))