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.
def gcd(x,y):
    if(y==0):
        return x
    return gcd(y,x%y)


n=int(input())

if(n==1):
    print(1)
elif(n==2):
    print(2)
elif(n%2):
    print((n*(n-1)*(n-2)))
else:
    max1=(n-1)*(n-2)*(n-3)
    for i in range(n-1,max(n-50,1),-1):
        gcd1=gcd(n,i)   
        lcm1=n*i/gcd1
        for j in range(n,max(n-50,0),-1):
            gcd2=gcd(lcm1,j)
            max1=max(max1,(i*j*n)//gcd2)
    print(max1)
                
    
    