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 gcd
def lcm(x, y, z):
    gcd2 = gcd(y, z)
    gcd3 = gcd(x, gcd2)
    lcm2 = y*z // gcd2
    lcm3 = x*lcm2 // gcd(x, lcm2)
    return lcm3
a=int(input())
x=0
for i in range(2,a+1):
    for j in range(2,a+1):
        for k in range(2,a+1):
            if(lcm(i,j,k)>x):
                x=lcm(i,j,k)
print(x)           
