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 math
import sys
import collections
import random
input = sys.stdin.readline
M = 10**9 + 7
def qe():
    return int(input())
def tr():
    return [int(_) for _ in input().split()]
def rt():
    return input()
def resheto(N):
    if N == 2:
        return 2
    primes = [i for i in range(N + 1)]
    primes[1] = 0
    i = 2
    while i <= int(N ** 0.5) + 2:
        if primes[i] != 0:
            j = i ** 2
            while j <= N:
                primes[j] = 0
                j = j + i
        i += 1
    primes = [i for i in primes if i != 0]
    return primes

n = qe()
k = n * (n - 1)
ans = 0
for i in range(1, n):
    ans = max(ans, math.lcm(k, i))
print(ans)