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()) 
max_odd = n if n % 2 else n - 1  
max_even = n -1 if n % 2 else n 
ans = max_odd * (max_odd - 2) * (max_odd - 4) 
cands = [] 
for i in range(0,5,2): 
    cands.append(max_even - i) 
    cands.append(max_odd - i) 
for i in cands:
    for j in cands:
        for k in cands:
            if gcd(i,j) == 1 and gcd(i,k) == 1 and gcd(j,k) == 1:
                ans = max(i*j*k, ans) 
print(ans)
