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 NOD(a, b):
    while a != b:
        if a > b:
            a -= b
        else:
            b -= a
    return(a)
    
def NOK(a, b):
    i = (a*b) // NOD(a, b)
    return(i)


n = int(input())
maxnok = 0

for i in range(1,n+1):
    for j in range(1,i):
        for f in range(1,j):
            nokk = NOK(NOK(i,j), f)
            if maxnok < nokk:
                maxnok = nokk
print(maxnok)