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 collections import Counter,defaultdict,deque
import heapq as hq
#alph = 'abcdefghijklmnopqrstuvwxyz'
#from math import factorial as fact

#nl = '\n'
import sys
input=sys.stdin.readline
#print=sys.stdout.write
#tt = int(input())
#total=0
#n = int(input())
#n,m,k = [int(x) for x in input().split()]
#n = int(input())
#l,r = [int(x) for x in input().split()]
n = int(input())
if n==1:
   print(1)
elif n ==2:
   print(2)
elif n==3:
   print(6)
else:
   if n%2==0:
      print(max(n*(n-1)*(n-2)//2,(n-1)*(n-2)*(n-3)))
   else:
      print(n*(n-1)*(n-2))




   
   
 
