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 ii(): return int(input())
def si(): return input()
def mi(): return map(int,input().split())
def li(): return list(mi())

import math

def gcd(x,y):
    while y:
        x,y=y,x%y
    return x

n=ii()
if n==1:
    print(1)
    exit()
if n==2:
    print(2)
    exit()
if n%2:
    print(n*(n-1)*(n-2))
else:
    print((n-1)*(n-2)*(n-3))