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):
    """Return greatest common divisor using Euclid's Algorithm."""
    while b:      
        a, b = b, a % b
    return a

def lcm(a, b):
    """Return lowest common multiple."""
    return a * b // gcd(a, b)

n=int(input())

if n==1:
    print(1)
elif n==2:
    print(n)
elif n==3:
    print(6)
    
elif n%2==0:
    print((n-2)*(n-1)*(n-3))
else :
    m=1
    for i in range(1,n+1,3):
        if lcm(i,lcm(i+1,i+2))>m:
            m=lcm(i,lcm(i+1,i+2))
    print(m)
        
        
    
