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 itertools import combinations_with_replacement
 
# Recursive function to return gcd of a and b
def gcd(a,b):
    if a == 0:
        return b
    return gcd(b % a, a)
 
# Function to return LCM of two numbers
def lcm(a,b):
    return (a / gcd(a,b))* b
 
n=int(input())
if n<3:
    print(n)
else:
    arr=[n,n-1,n-2,n-3]
    op1=lcm(lcm(n,(n)),(n))
    ans=op1
    comb=combinations_with_replacement(arr,3)
    for i in list(comb):
        x=list(i)
        ans=max(ans,lcm(lcm(x[0],x[1]),x[2]))
        #print(list(i))
    print(int(ans))
