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 lcmm(a,b,c):
	l=lcmx(a,b)
	if(l>c):
		k=lcmx(l,c)
	else:
		k=lcmx(c,l)
	return k
def lcmx(a,b):
	t=a
	while(1):
		if(t%b==0 and t%a==0):break
		t+=1
	return t

n=int(input())
if(n>=3):
	a=[]
	for i in range(3):
		a.append(n-i)
	j=lcmm(a[0],a[1],a[2])
	print(j)
if(n==1) or(n==2):
	print(n)