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

def solve(nums):
    a, b, c = nums
    r1 = math.gcd(a, b)
    r1 = (a * b) // r1
    temp = r1
    r2 = math.gcd(temp, c)
    return (temp * c) // r2

n = int(input())
ans = 0
i = max(1, n - 50)
k = max(1, n - 50)
while i <= n:
    j = max(1, n - 50)
    while j <= n:
        k = max(1, n - 50)
        while k <= n:
            ans = max(ans, solve([i,j,k]))
            k += 1
        j += 1
    i += 1        
print(ans)