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):
    if a > b:
        a, b = b, a
    if b % a==0:
        return a
    return gcd(b % a, a)
    
def lcm(X):
    if len(X)==1:
        return X{0]
    l1 = X[0]*X[1]//gcd(X[0], X[1])
    if len(X)==2:
        return l1
    return l1*X[2]//gcd(l1, X[2])
    
def process(n):
    answer = 0
    for c in [[n], [n-1], [n-2], [n, n-1], [n, n-2], 
    [n, n-3], [n-1, n-2], [n-1, n-3], [n-2, n-3], 
    [n, n-1, n-2], [n, n-2, n-3], [n, n-1, n-3], [n-1, n-2, n-3]]:
        if min(c) > 0:
            answer = max(answer, lcm(c))
    return answer
   
    
n = int(input())
print(process(n))

