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.
x = int(input())
def gcd(a, b):
    while b:
        a, b = b, a % b
    return a
if x == 1:
    print(1)
elif x == 2:
    print(2)
else:
    if x % 2 == 0:
        f = (x * (x - 2)) // gcd(x, (x - 2))
        print(f * (x - 1))
    else:
        print(x * (x - 1) * (x - 2))