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 lcm(A,B):
        # code here 
    maxm = max(A,B)
    minm = min(A,B)
    while maxm%minm!=0:
        temp = maxm
        maxm = minm
        minm = temp%minm
    gcd = minm
    
    lcm = (A*B)//gcd
    
    return lcm

def max_lcm(n):
    
    if n<4:
        if n==1:
            return 1
        elif n==2:
            return 2
        elif n==3:
            return 6
    max = 0
    for i in range(n,3,-1):
        lcm_val = lcm(lcm(n,n-1),n-2)
        if lcm_val>max:
            max = lcm_val
    return max
ans = max_lcm(n)
print(ans)
        