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.
import random, math
from copy import deepcopy as dc



def gcd(a, b):
	if b== 0:
		return a
	return gcd(b, a%b)

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

# Function to call the actual solution
def solution(n):
	a = dc(n)
	if n % 2 != 0:
		b = dc(n - 1)
		c = dc(n - 2)
	elif gcd(n, n-3) == 1:
		b = n-1
		c = n - 3
	else:
		a = n - 1
		b = n - 2
		c = n - 3
	l = lcm(lcm(a,b), c)
	return l



# Function to take input
def input_test():
	n = int(input())
	out = solution(n)
	print(out)

# Function to check test my code
def test():
	pass

# seive()
input_test()
# test()