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.
import sys
input = lambda: sys.stdin.readline().rstrip()

N = int(input())

if N<3:
    exit(print(N))

D = [0]*(N+1)

A = []
for i in range(2,N+1):
    if D[i]==0:
        tmp = 0
        for j in range(i,N+1,i):
            if D[j]==0:
                D[j] = 1
                tmp = j
        A.append(tmp)
    
A.sort(reverse=True)
ans = 1
for a in A[:3]:
    ans*=a
#print(A)
print(ans)
            