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
def lcm(a,b):
    return (a*b)//gcd(a,b)
n = int(input())
for i in range(n,-1,-1):
    if (i-1)%6==0 or (i+1)%6==0 or i==2:
        p = i
        break
#even number 
if p+1<n:
    even = p+1
else:
    even = p-1

#odd number
if p+2<n:
    odd = p+2
else:
    odd = p-2
x = lcm(p,even)
x = lcm(x,odd)
print(x)