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.
# given a number n
# find three number smaller than equals to n (they don't have to be distinct)
# find these numbers such that the LCM is largest

n = int(input())

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

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

mn = max(n-10, 1)
ans = 0
for i in range(n, mn, -1):
	for j in range(i-1, mn, -1):
		for k in range(j-1, mn, -1):
			# print(i, j, k)
			cur = lcm(lcm(i, j), k)
			if cur > ans:
				# print(cur)
				ans = cur

print(ans)
