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.
from math import gcd
 
def lcm(a,b):
    return (a / gcd(a,b))* b
 
n = int(input())

if (n == 1):
    print(n)

else:
    result = -1
    n1 = n * (n - 1)
    n2 = (n-1) * (n-2)
    for i in range(1, n+1):
        result = max(result, lcm(n1, i))
        result = max(result, lcm(n2, i))
    
    print(int(result))
 	  	  	 	 	   	 	    	    				