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.
from math import sqrt

def isPrime(i):
    cut = int(sqrt(i))
    for j in range(2, cut+1):
        if i%j == 0:
            return False
    return True

def prime():
    lst = []
    for i in range(2,100):
        if isPrime(i):
            lst.append(i)
    return lst



def lcm(n):
    lst = []
    prime_lst = prime()
    while len(lst) < 3:
        for i in range(10):
            if n % prime_lst[i] == 0:
                lst.append(n)
                prime_lst.pop(i)
        n -= 1
    return lst[0]*lst[1]*lst[2]

n = int(input())
print(lcm(n))
