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 collections import Counter
import string
import bisect
#import random
import math
import sys
# sys.setrecursionlimit(10**6) 
from fractions import Fraction
def array_int():
    return [int(i) for i in sys.stdin.readline().split()]
def vary(arrber_of_variables):
    if arrber_of_variables==1:
        return int(sys.stdin.readline())
    if arrber_of_variables>=2:
        return map(int,sys.stdin.readline().split()) 
def makedict(var):
    return dict(Counter(var))
def lcm(a,b):
    return math.gcd(a,b)//(a*b)
testcases=1
for _ in range(testcases):
    n=vary(1)
    if n==1:
        print(1)
    elif n==2:
        print(2)
    else:
        if n%2!=0:
            print(n*(n-1)*(n-2))
        else:
            print(n*(n-1)*(n-3))