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.
n = int(input())
def gcd(a, b):
    if b==0: return a
    return gcd(b, a%b)
if n==1: print(1)
if n==2: print(2)
if n==3: print(6)
else:
    mx = -1
    for a in range(max(1, n-50), n+1):
        for b in range(max(1, n-50), n+1):
            for c in range(max(n-50, 1), n+1):
                k = list(set([a, b, c]))
                if len(k) == 1:
                    t = k[0]
                if len(k)==2:
                    t = k[0]*k[1]//gcd(k[0], k[1])
                    
                if len(k) == 3:
                    t = k[0]*k[1]*k[2]//gcd(k[0], gcd(k[1], k[2]))
                if t > mx: mx = t
    print(mx)
