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 fractions import gcd

n= int(input())

lim = 100
r = 0

if n < 2 :
    print(n)
elif n == 3 :
    print(6)
else:
    i = n
    while i>0 and i>n-lim:
        j = i-1
        while j>0 and j>n-lim:
            k = j-1
            while k>0 and k>n-lim:
                x = (i*j)//gcd(i,j)
                x = (k*x)//gcd(k,x)
                r = max(r,x)
                k -= 1
            j -= 1
        i -=1
    print(r)