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.
'''input
1000
'''
from sys import stdin
import math
from collections import defaultdict, deque



def LCM(a, b):
	return (a * b) // math.gcd(a, b)
# main starts
n = int(stdin.readline().strip())
if n == 1 or n == 2:
	print(n)
	exit()
elif n == 3:
	print(6)
if n > 3:
	if n % 2 == 0:
		if n % 3 == 0:
			print((n - 1) * (n - 2) * (n - 3))
		else:
			print(n * (n - 1) * (n - 3))
	else:
		print(n * (n - 1) * (n - 2))
