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
def main():
	n=int(input())
	if n==2:
		print(2)
	elif n==1:
		print(1)
	else:
		k=0;
		for i in range(max(n-50,1), n+1):
			for j in range(max(1,n-50), n+1):
				for z in range(max(1,n-50), n+1):
					l=(i*j)//gcd(i,j)
					k=max((z*l)//gcd(l,z),k)
		print(k)
if __name__=='__main__':
	main()