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.
#!/usr/bin/python3

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a%b)

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

n = int(input())

ans = 0
if n < 3:
	ans = n
else:
	if (n&1 == 1):
		ans = n * (n-1) * (n-2)
	else:
		ans = (n-1) * (n-2) * (n-3)
		p = n * (n-1)
		for i in range(1, n-1):
			cur = lcm(p, i)
			if cur > ans:
				ans = cur
print(ans)
