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())

ans=0
for i in range(n,max(0,n-101),-1):
    for j in range(i,max(0,n-101),-1):
        for k in range(j,max(0,n-101),-1):
            x=(i*j)//gcd(i,j)
            x=(x*k)//gcd(x,k)
            ans=max(ans,x)
print(ans)
