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):
    while b != 0:
        a %= b
        c = b
        b = a
        a = c
    return a


n = int(input())
maxi = 0
if n >= 100:
    for i in range(n - 100, n + 1):
        for j in range(n - 100, n + 1):
            for k in range(n - 100, n + 1):
                tmp = (i * j) / gcd(i, j)
                counter = (tmp * k) / gcd(tmp, k)
                maxi = max(counter, maxi)
else:
    for i in range(1, n + 1):
        for j in range(1, n + 1):
            for k in range(1, n + 1):
                tmp = (i * j) / gcd(i, j)
                counter = (tmp * k) / gcd(tmp, k)
                maxi = max(counter, maxi)
print(int(maxi))
