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

n = int(input())

if n <= 5:
    print([0, 1, 2, 6, 12, 60][n])
    exit()

sol = 1
a = [n, n-1, n-2, n-3, n-4, n-5]
for i in range(5):
    for j in range(i):
        for k in range(j):
            sol = max(
                sol,
                a[i] * a[j] * a[k] // gcd(gcd(a[i], a[j]), a[k])
            )

print(sol)
