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(b,a):
	if b%a==0:
		return a
	return gcd(a,b%a)
n=int(input())
a=[1,2]
if n<=2:
	print(a[n-1])
elif n&1:
	print(n*(n-1)*(n-2))
else:
	arr=[1]*(n-2)
	temp=n*(n-1)
	#print("H")
	i=n-2
	while(i>2):
		if i&1:
			g=gcd(n,i)*gcd(n-1,i)
		else:
			g=gcd(n-1,i)*2
		arr[i-1]=(temp*i)//g
		i-=1
	print(max(arr))
	