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
x = int(input())
a = x * (x-1) * (x-3)
b = x * (x-1) * (x-2)
if x == 1:
    print(1)
    quit()
if x == 2:
    print(2)
    quit()
if x % 6 in [2, 4]:
    print(a)
elif x % 6 in [1, 3, 5]:
    print(b)
else:
    if x == 6:
        print(60)
    else:
        for i in range(x, 0, -1):
            if gcd(i, x) == 1 and gcd(i, x-1) == 1:
                print(x*(x-1)*i)
                quit()
