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
input=lambda : stdin.readline().strip()
from math import ceil,sqrt,factorial
from collections import deque
def gcd(a,b):
	while a%b!=0:
		a,b=b,a%b
	return b
n=int(input())
if n<=2:
	print(n)
else:
	if n%2!=0:
		print(n*(n-1)*(n-2))
	else:
		t=n*(n-1)
		ma=t
		for i in range(1,n-1):
			ma=max(ma,t*i//gcd(t,i))
		print(ma)