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.
n=int(input())
def gcd(a,b):
  mine=min(a,b)
  maxe=max(a,b)
  while maxe!=1:
    if maxe%mine==0:
      return mine
    else:
      temp=mine
      mine=maxe%mine
      maxe=temp
  return mine

def lcm(a,b):
    return (a*b)/(gcd(a,b))
maximumlcm=1
for i in range(n-2,1,-1):
  if gcd(i,n)==1 and gcd(i,n-1)==1:
      maximumlcm= n*(n-1)*i
      break
print(maximumlcm)