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.
import math
def answer(n):
    if n==1:
        return 1
    elif n==2:
        return 2
        
    
    if n%2!=0:
        return n*(n-1)*(n-2)
    elif n<=6:
        return n*(n-1)*(n-2)//2
    
    else:
        prime=[1]*(n-1)
        prime[0]=prime[1]=0
        for i in range(2,int(math.sqrt(n))+1):
            if prime[i]==1:
                p=2*i
                while p<=n-2:
                    if prime[p]==1:
                        prime[p]=0
                        
                    p+=i
       
        for i in range(n-2,-1,-1):
            if prime[i]==1:
                return max(n*(n-1)*i,(n-1)*(n-2)*(n-3))
            

n=int(input())

print(answer(n))