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() )

if n == 1:
    print( 1 )
    exit(0)
elif n == 2:
    print( 2 )
    exit(0)
    
def gcd( a, b ):
    if b == 0:
        return ( a )
    return ( gcd( b, a%b ) )
    
def lcm( a, b ):
    return ( a * b // gcd(a,b) )
    
if n % 2 == 1:
    ans = lcm( n, lcm( n-2, n-1 ) )
else:
    ans = 0
    for i in range( n-50, n+1 ):
        for j in range( n-50, n+1 ):
            for k in range( n-50, n+1 ):
                ans = max( ans, lcm( i, lcm(j,k) ) )
    
print( ans )