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 gcd(s,b): return b if s==0 else gcd(b%s,s)
def solv(n):
  nn1  = n*(n-1)
  if n%2: return nn1*(n-2)
  lb = (n-2)*(n-3)//n  #lower bound
  L  = [i*nn1//gcd(i,nn1) for i in range(lb,n-1)] #[lb,n-2]
  return max(max(L),(n-1)*(n-2)*(n-3))

n   = int(input())
print(solv(n))