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 get_numbers(value, count_, info):
    if count_ == 0:
        return info
    if value < 1:
        info.append(1)
    else:
        info.append(value)
    return get_numbers(value - 1, count_ - 1, info)        

def solve(nums):
    result = math.gcd(nums[0], nums[1])
    result = (nums[0] * nums[1]) // result
    temp = result
    result = math.gcd(temp, nums[2])
    result = (temp * nums[2]) // result
    return result

n = int(input())
numbers = get_numbers(n, 3, [])
ans = solve(numbers)
print(ans)