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

n = int(input())
ans = n
for i in range(n, 2, -1):
    mul = n * (n - 1)
    den = gcd(n , n - 1)
    lcm1 = mul // den

    mul = (n - 2) * lcm1
    den = gcd(n - 2, lcm1)
    lcm = mul // den
    ans = max(ans, lcm)

print(ans)
