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(a, b):
	while a:
		b %= a
		a, b = b, a
	return b

def lcm(a, b):
	return a // gcd(a, b) * b

n = int(input())
ans = 0
for i in range(n, max(1, n - 200), -1):
	for j in range(i, max(1, i - 200), -1):
		cur = lcm(i, j)
		for k in range(j, max(1, j - 200), -1):
			ans = max(ans, lcm(cur, k))
print(ans)
