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.
n=int(input())
def gcd(a,b):
    if (a>b):
        maximum=a
        minimum=b
    else:
        minimum=a
        maximum=b
    if(minimum==0):
        return(maximum)
    while((maximum%minimum)!=0):
        temp=maximum 
        maximum=minimum
        minimum=temp%maximum
    return(minimum)
if(n==1):
    print(1)
else:
    if(n==2):
        print(2)
    else:
        p=gcd(n,n-1)
        x=(n*(n-1))//p
        q=gcd(x,n-2)
        y=(x*(n-2))//q
        print(y)