Codeforces Round 146 (Div. 2)
C
LCM Challenge
Codeforces
未评级
原题
← BD →
翻译中…

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?

翻译中…

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*$.

翻译中…

Note

翻译中…

The least common multiple of some positive integers is the least positive integer which is multiple for each of them.

翻译中…

The result may become very large, 32-bit integer won't be enough. So using 64-bit integers is recommended.

翻译中…

For the last example, we can chose numbers $7$, $6$, $5$ and the LCM of them is $7·6·5 = 210$. It is the maximum value we can get.

翻译中…

样例

Input #1
9
Output #1
504
InputCopy OutputCopy
Input #2
7
Output #2
210
InputCopy OutputCopy
题目信息
题号
236C
时间限制
2 s
内存限制
256 MB

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。