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.
from math import gcd
n=int(input())
r=int(n)
l=[0for i in range(r)]
def a(n):
    if n==1:return 1
    for i in range(r):l[i]=gcd(i,n)
    o=min(l)
    for i in range(r-1,-1,-1):
        if l[i]==o:
            n*=i
            break
    return n
print(a(a(n)))