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.
prime=[ True for i in range(1000001)]
prime[1]=prime[0]=False
primenum=[]
for i in range(2,1000001):
    if(prime[i]):
        primenum.append(i)
        for j in range(2*i,1000001,i):
            prime[j]=False

            
    
def bs(primenum,n):
    l=1
    u=len(primenum)-1
    res=-1
    while(l<=u):
        mid=l+(u-l)//2
        if(primenum[mid]>=n):
            u=mid-1
        elif(primenum[mid]<n):
            res=primenum[mid]
            l=mid+1
    
    return res        
            


n=int(input())
x=1
if(n%2):
    print(n*(n-1)*(n-2))
else:
    if(n==6):
        print(60)
    elif(n%3):
        print(n*(n-1)*(n-3))
    else:
        x=bs(primenum,n-1)
        print(x)
        print(n*(n-1)*x)