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 gcd(a, b):
    if b==0: return a
    return gcd(b, a%b)
n = int(input())
if n==1: print(1)
elif n==2: print(2)
elif n==3: print(6)
else:
    a = n
    b = n-1
    c = n-2
    if c%2==0: c-=1
    print(a*b*c//(gcd(gcd(a, b), c)))
