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.
from math import gcd

n = int(input())
n += 1
dp = [ [0]*4for _ in range(n) ]
def lcm(a,b):
	return a*b//gcd(a,b)

for i in range(n):
	for j in range(1,4):
		if j==1:
			dp[i][j] = i
		elif i<=1:
			dp[i][j] = i

		else:
			dp[i][j] = max(  dp[i-1][j], lcm(i,dp[i-1][j-1])  )
print(dp[-1][3])



#  C:\Users\Usuario\HOME2\Programacion\ACM