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(x, y):
    if x == 0:
        return y
    else:
        return gcd(y % x, x)


def lcm(x, y):
    return x*y/gcd(x, y)


n = int(input())
if n == 6:
    print(60)
else:
    ve = [n]
    while True:
        n -= 1
        if n == 0:
            break
        if len(ve) == 3:
            break
        ji = 1
        for i in ve:
            if gcd(i,n) > 1:
                ji = 0
        if ji == 1:
            ve.append(n)
    ans = 1
    for i in ve:
        ans = lcm(ans, i)
    print(ans)

