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


def lcm(a, b):
    return (a * b) // gcd(a, b)


N = int(input())
mx = 1
for a in range(max(N - 8, 1), N + 1):
    for b in range(a, N + 1):
        for c in range(b, N + 1):
            mx = max(lcm(lcm(a, b), c), mx)
print(mx)
