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 isprime(n):
    for i in range(2,int(math.sqrt(n))):
    	if(n%i==0):
    		return False

    return True

import math
n=int(input())
if(n==1):
	print(1)
	return
if(n==2):
	print(2)
	return


tm=n
while(tm>0):
	if(isprime(tm)):
		break
	tm=tm-1
ans=0
if(tm==n):
    ans=tm*(tm-1)*(tm-2)
elif(tm==n-1):
    ans=tm*(tm-1)*(tm-2)
else:
	ans=tm*(n)*(n-1)

print(ans)
print()

