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.
def maxPrime(n):
    sieve = [1]*(n+1)
    for p in range(2, n+1):
        if (sieve[p] == 1):
            for np in range(p*p, n+1, p):
                sieve[np] = 0
    
    for i in range(n, -1, -1):
        if (sieve[i] == 1):
            return i

n = int(input())

if n<3:
    print(n)
else:
    nearestPrime = maxPrime(n)
    if nearestPrime >= (n-1):
        print(n*(n-1)*(n-2))
    else:
        print(nearestPrime*n*(n-1))
        
