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):
    c = a % b
    return gcd(b, c) if c else b

s, a = 0, int(input())
while a ** 3 > s:
    b = a - 1
    while a * b * b > s:
        if gcd(a, b) == 1:
            d = a * b
            c = b - 1
            while d * c > s:
                if gcd(c, d) == 1: s = d * c
                c -= 1
        b -= 1
    a -= 1
print(s)  