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

n = int(input())
res = n * max(1, n - 1)
i = n
while i > 1 and (gcd(i, n) != 1 or gcd(i, n - 1) != 1):
	i -= 1
print(res * i)
