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.
f = int(input())
def HOK2(q, w):
  e = q
  r = w
  while w != 0:
    q %= w
    q, w = w, q
  return (e * r) // q
def HOK3(i, j, k):
  return HOK2(i, HOK2(j, k))
got = 0
for i in range(1, f + 1):
  for j in range(1, f + 1):
    for k in range(1, f + 1):
      got = max(got, HOK3(i, j, k))
print(got)
