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 SieveOfEratosthenes(n):
    prime = [True for i in range(n + 1)]
    p = 2
    while (p * p <= n):

        if (prime[p] == True):
            for i in range(p * p, n + 1, p):
                prime[i] = False
        p += 1
    P=[]
    for i in range(2,n):
        if prime[i]:
            P.append(i)
    return P

from  math import  log,floor,lcm
def f(n):
    primes=SieveOfEratosthenes(n+1)
    an=[]
    for i in primes:
        if i>n:
            break
        lg=floor(log(n,i))
        an.append((pow(i,lg),i))
    # print(an)
    an.sort(key=lambda s:s[0],reverse=True)
    bd1=an[0][0]
    bd2=an[1][0]
    tt=1
    for i,pp in an[2:]:
        if tt*pp>n:
            break
        tt*=pp
    return lcm(bd1,bd2,tt)
print(f(int(input())))

	 	   			   	     	 	 	 					 	