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 (a,b):
	if b==0:
		return a
	return gcd(b,a%b)

n = int(input())
c = 1
a = [n]
while c!=3:
	if gcd(n,a[-1])==1:
		a.append(n)
		n-=1
		c+=1
	else:
		n-=1
	if n==0:
		break
p = 1
for i in a:
	p*=i
print (p)