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 lcm(x, y):
   if x > y:
       greater = x
   else:
       greater = y
   while(True):
       if((greater % x == 0) and (greater % y == 0)):
           lcm = greater
           break
       greater += 1
   return lcm

n = int(input())
if (n==1 or n==2):
    print (n)
elif (n==3):
    print (6)
elif (n==4):
    print (12)
elif (n==5):
    print (60)
elif (n==6):
    print (60)
else:
    if (n%2 !=0):
        print (n*(n-1)*(n-2))
    else:
        ans = (n-1)*(n-2)*(n-3)
        x = n*(n-1)
        if (lcm(x,n-2) > ans):
            ans = lcm(x,n-2)
        if (lcm(x,n-3) > ans):
            ans = lcm(x,n-3)
        x = (n-2)*(n-3)
        if (lcm(x,n) > ans):
            ans = lcm(x,n)
        print (ans)

