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):
	maxx=max(a,b)
	minn=min(a,b)

	while maxx%minn!=0:
		temp=maxx
		maxx=minn
		minn=temp%minn
	return minn

n=int(input())

if n<=2:
    print(n)
    continue
if n==3:
    print(gcd(n,n-1)
    continue
a1=n
a2=n-1
a3=n-2

g=gcd(a1,a2)
g=gcd(g,a3)
l=(a1*a2*a3)/g
print(l)