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 lcm(a,b):
	return a*b//gcd(a,b)
def lcm_3(a,b,c):
	return lcm(a,lcm(b,c))
def gcd(a,b):
	if b==0:
		return a 
	return gcd(b,a%b)

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