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 lcm(x,y):
    return x*y//gcd(x,y)

n=int(input())

ANS=n
for i in range(n-200,n+1):
    for j in range(i+1,n+1):
        for k in range(j+1,n+1):
            if i>=1 and j>=1 and k>=1:
                ANS=max(ANS,lcm(lcm(i,j),k))

print(ANS)
