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.
from math import *
from collections import *
from random import *
from bisect import *
import sys
input=sys.stdin.readline
def lis():
    return list(map(int,input().split()))
def ma():
    return map(int,input().split())
def inp():
    return int(input())
n=inp()
if(n==1):
    print(1)
    exit(0)
elif(n==2):
    print(2)
    exit(0)
for i in range(n,0,-1):
    fl=0
    if(i%2==0):
        continue
    for j in range(3,int(pow(i,0.5))+1):
        if(i%j==0):
            fl=1
    if(fl==0):
        pos=i
        break
if(pos==n):
    print(pos*(pos-1)*(pos-2))
elif(pos==n-1):
    print(pos*(pos-1)*(pos+1))
else:
    print(pos*(pos+1)*(pos+2))

    
            

        
            
        
    
        
    
