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(x, y):
    if x: return gcd(y % x, x)
    return y
def lcm(x, y):
    return x * y // gcd(x, y)
n = int(input())
r = range(max(1, n - 20), n+1)
print(max([lcm(lcm(x,y),z) for x in r for y in r for z in r]))
