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.
n = int(input())
gcd = lambda a, b: b if a % b == 0 else gcd(b, a % b)

if n % 2:
    res = n * (n - 1) * (n - 2)
else:
    for i in range(n - 3, 0, -2):
        if gcd(n, i) != 1 or gcd(n - 1, i) != 1:
            continue
        res = max(n * (n - 1) * i,
                int(n * (n - 1) / 2) * (n - 2),
                (n - 1) * (n - 2) * (n - 3))
        break

if n < 3:
    res = n

print(res)
