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.
import math
n=int(input())
if n==1 or n==2:
    print(n)
elif n==3:
    print((n*2)//math.gcd(n,2))
else:
    if n%2!=0:
        first=(n*(n-1))//math.gcd(n,n-1)
        print((first*(n-2))//math.gcd(n-2,first))
    else:
        one=n
        two=n-1
        lcm=(n*(n-1))//math.gcd(n,n-1)
        ans=(lcm*(n-2))//math.gcd(n-2,lcm)
        n-=2
        while n:
            if math.gcd(one,n)==1 and math.gcd(two,n)==1:
                break
            else:
                n-=1
                res=(one*two)//math.gcd(one,two)
                res=(res*n)//math.gcd(res,n)
                ans=max(ans,res)
        print(ans)
