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.
import sys
input = sys.stdin.readline
from math import gcd


n = int(input())
m = n
q = 0
f = 1
while n != 1 and n != m-1000:
    a = n
    while a != 1:
        if n % a != 0:
            break
        a -= 1
    c = n*a
    d = c
    for i in range(n, max(0, n-10000), -1):
        x = gcd(c, i)
        d = max(d, c//x*i)
    f = max(d, f)
    n -= 1
print(f)