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.
"""import sys,math
n=int(input())
mx=-1-sys.maxsize
val=[]
def meth1(i,k):
    return (i*k)//math.gcd(i,k)

def meth(i,j,k):
    
    return meth1(i,meth1(j,k))
for i in range(1,n+1):
    for j in range(1,n+1):
        for k in range(1,n+1):
            if meth(i,j,k)>mx:
                mx=meth(i,j,k)
                val=[i,j,k]

print(val)
print(mx)
"""

n=int(input())
if n==1:
    print(1)
elif n==2:
    print(2)
elif n%2==1:
    print(n*(n-1)*(n-2))
elif n%3==0:
    print((n-2)*(n-1)*(n-3))
else:
    print((n)*(n-1)*(n-3))
