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(a,b): 
      
    # Everything divides 0  
    if (b == 0): 
         return a 
    return gcd(b, a%b) 

c = int(input())
if c == 1 or c == 2:
    print(c)
else:
    i=c-2
    maxi=0
    while i>=0:
        k=(c*(c-1)*i)//gcd(c*(c-1),i)
        if k>maxi:
            maxi=k
        i-=1
    c-=1
    i=c-2
    maxi1=0
    while i>=0:
        k=(c*(c-1)*i)//gcd(c*(c-1),i)
        if k>maxi1:
            maxi1=k
        i-=1
    print(max(maxi,maxi1))

