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 math import gcd
def solve(n):
    if n <= 2: return n
    if n & 1:
        return n * (n - 1) * (n - 2)
    ans = max(solve(n - 1), n * (n - 1) * (n - 2) // 2)
    for p in range(n - 3, 0, -2):
        if gcd(p, n) == 1 and gcd(p, n - 1) == 1:
            ans = max(ans, n * (n - 1) * p)
            break
    return ans
n = int(input())
print(solve(n))

                                                                                                                                    