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(a, b):
  return (a*b)//gcd(a, b)
n=int(input())
if(n<=2):
  print(n)
elif(n%2==1):
    print(n*(n-1)*(n-2))
else:
    ans=(n-3)*(n-1)*(n-2)
    for k in range(1, n-1):
      ans=max(ans, lcm(n*(n-1), k))
    print(ans)