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.
# -*- coding: utf-8 -*-
#https://codeforces.com/problemset/problem/235/a

from math import gcd
n, ans = int(input()), 0
if n < 3:
    print(n)
    exit()
for i in range(2, n):
    g1 = gcd(n, n - i)
    g2 = gcd(n - 1, n - i)
    ans = max(ans, n * (n - 1) * (n - i) / (g1 * g2))
    if g1 == 1 and g2 == 1:
        break
if n % 2 == 0:
    ans = max(ans, (n - 1) * (n - 2) * (n - 3))
print(ans)