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(m,n):
    while(n!=0):
        m,n=n,m%n
    return m    
n=int(input())
l=[i for i in range(1,n+1)]
gcd=0
maxi=0
for i in range(n,1,-1):
    gcd=GCD(l[i-1],l[i-2])
    gcd=GCD(gcd,l[i-3])
    lcm=l[i-1]*l[i-2]*l[i-3]//gcd
    maxi=max(maxi,lcm)
print(maxi)    