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):
    max1 = max(a,b)
    min1 = min(a,b)
    while max1%min1 !=0:
        temp = max1
        max1 =  min1
        min1 = temp%min1
    return min1
def lcm(a,b):
    lcm1 = (a*b)//gcd(a,b)
    return lcm1
n = int(input())
if n > 3:
    a, b, c = n, n - 1, n - 2
    res = lcm(a, b)
    ans = lcm(res, c)
    print(ans)
elif n ==3:
    print("6")
elif n==2:
    print("2")
elif n==1:
    print("1")