acdream.LCM Challenge(数学推导)

 LCM Challenge
Time Limit:1000MS     Memory Limit:64000KB     64bit IO Format:%lld & %llu

Description

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 thann. Can you help me to find the maximum possible least common multiple of these three integers?

Input

The first line contains an integer n (1 ≤ n ≤ 10^6) — the n mentioned in the statement.

Output

Print a single integer — the maximum possible LCM of three not necessarily distinct positive integers that are not greater than n.

Sample Input

9

Sample Output

504
奇数时直接取前3,偶数时讨论前4(总共才三种)即可。
原文地址:https://www.cnblogs.com/get-an-AC-everyday/p/4431903.html