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 itertools import combinations_with_replacement

I = lambda: int(input())
IL = lambda: list(map(int, input().split()))

def gcd(x, y):
    if y == 0:
        return x
    return gcd(y, x%y)

def lcm(x, y, z):
    ans = x * y // gcd(x, y)
    ans = ans * z // gcd(ans, z)
    return ans

n = I()
print(max(lcm(*c) for c in combinations_with_replacement(range(max(1, n-5), n+1), 3)))
