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

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

def main():
	n = int(input())
	if n<=3:
		print(n)
	else:
		if n%2==1:
			print(n*(n-1)*(n-2))
		else:
			cr = (n-1) * (n-2) * (n-3)
			for i in range(n-50,n+1):
				for j in range(n-50,n+1):
					lcm = i*j / gcd(i,j)
					if lcm>cr:
						cr = lcm
			print(cr)
			
if __name__=='__main__':
	main()