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.
n=int(input())
def gcd(a,b):
	k=min(a,b)
	if(k<=0):
		return max(a,b)
	else:
		return gcd(k,max(a,b)%k)
def h(a,b,c):
	k=(a*b)//gcd(a,b)
	return (k*c)//gcd(k,c)

def calc(n):
    p=n*(n-1)
    a=n-2
    maxl=h(n-3,n-1,n-2)
    while(a>n//2):
        newl=h(a,n-1,n)
        if(newl>=maxl):
                maxl=newl
                break
        a-=1
    return maxl
            

    
def fun(n):
    if(n<=2):
        return n
    if(n==4):
        return 12
    if(n%2==0):
        return calc(n)
    else:
        n+=1
        return (n-1)*(n-2)*(n-3)
print(fun(n))
