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):
	h=gcdd(a,b,c)
	num=a
	num1=b*c//h
	l=num*num1//h
	return l
def gcdd(a,b,c):
	x=gcdx(b,c)
	y=gcdx(a,x)
	print(y)
	#return y
def gcdx(h,k):
	while(k):
		h,k=k,h%k
	return h

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