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 sys
input = sys.stdin.readline
from math import gcd


n = int(input())

a = n
while a != 1:
    if n % a != 0:
        break
    a -= 1
c = n*a
d = c
for i in range(n, 0, -1):
    x = gcd(c, i)
    d = max(d, c//x*i)
print(d)