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

def solve(a, b, c):
    per = a*b
    per = per*c
    return per

k = 100
ans = 0
n = int(input())
for i in range(n, n - k, -1):
    for j in range(n, n - k, -1):
        for t in range(n, n - k, -1):
            ans=max(ans, solve(i, j, t))
print(ans)
