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

def file_io():
    sys.stdin = open('input.txt', 'r')
    sys.stdout = open('output.txt', 'w')

def read_line():
    return [int(x) for x in sys.stdin.readline().split()]

def read_int():
    return int(sys.stdin.readline())

def read_str():
    return sys.stdin.readline()[:-1]

def print(*s, end='\n'):
    sys.stdout.write(f'{" ".join(str(x) for x in s)}{end}')

# file_io()

def solve():
    n = read_int()

    print(n*(n-1)*(n-2))

# t = read_int()
t = 1
while t > 0:
    solve()
    t -= 1