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.
#!/usr/bin/env python3
import collections, itertools, functools, math, fractions
import operator

def lcm(a, b):
    return (a*b)//fractions.gcd(a, b)

def solve(n):
    if n <= 2:
        return n

    if n%2 == 1:
        return lcm(n, lcm(n-1, n-2))

    offset = 100
    if n-offset < 0:
        offset = n
    r = 1
    for i in range(n, n-offset, -1):
        for j in range(i, n-offset, -1):
            for k in range(j, n-offset, -1):
                r = max(r, lcm(i, lcm(j, k)))
    return r


if __name__ == '__main__':
    print(solve(int(input())))

