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 sys import stdin, stdout
cin = stdin.readline
cout = stdout.write
mp = lambda:list(list(map(int, cin().split())))


def gcd(a, b):
	while b:
		a, b = b, a % b
	return a
	
def lcm(a, b):
	return a * b // gcd(a, b)


n, = mp()
if n < 3:
	cout(str(n) + '\n')

if n % 2:
	cout(str(n*(n-1)*(n-2)))
else:
	y = max(n*(n-2)//gcd(n, n-2), n*(n-3)//gcd(n, n-3))
	cout(str(y*(n-1)))

'''

lc = lcm(n, n-1)
lc = lcm(lc, n-2)
'''