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

def isprime(n):
    if n == 1:
        return False
    if n == 2:
        return True
    if n == 3:
        return True
    if (n % 2 == 0) or (n % 3 == 0):
        return False
    
    i = 5
    while i**2 <= n:
        if (n % i == 0) or (n % (i + 2)) == 0:
            return False
        i += 6
    
    return True

def largest_prime(n):
    for i in range(n, 1, -1):
        if isprime(i):
            return i

def answer(n):
    if n == 1:
        return 1
    if n == 2:
        return 2
    if n == 3:
        return 6
    if n == 4:
        return 12
    if n % 2 == 1:
        return n * (n-1) * (n-2)
    if n == 6:
        return 60    
    return n * (n-1) * largest_prime(n-2)


def main():
    n = int(sys.stdin.readline())
    print(answer(n))
    return
main()