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 solve():
    n = int(input())
    s = [n]
    for i in range(n-1, 0, -1):
        x = [fractions.gcd(j, i) for j in s]
        if x.count(1) == len(s):
            s.append(i)
            if len(s) == 3:
                break
    return functools.reduce(operator.mul, s)


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

