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.
import sys
#sys.setrecursionlimit(10**7)
input = sys.stdin.readline

############ ---- Input Functions ---- ############
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))
############ ---- Input Functions ---- ############

def LCM_Challenge():
    n = inp()

    if n == 1:
        print(1)
    elif n == 2:
        print(2)
    elif n % 2 != 0 :
        print(n*(n-1)*(n-2))
    else:
        num1 = (n-1)*(n-2)*(n-3)
        num2 = (n*(n-1)*(n-2))//2
        print(max(num1,num2))
    
    return
    


LCM_Challenge()