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=sys.stdin.readline
from itertools import permutations
from collections import defaultdict as dd
from collections import deque
from bisect import bisect_left,bisect_right
from math import comb as C
from heapq import heappop,heappush,heapify
MOD=10**9+7;inf=float("inf");DIRS=[[1,0],[-1,0],[0,1],[0,-1]]

n=int(input()) # odd odd -1 odd -2 # even*(even-1)*(even-3) 8 7 5 8 7 6
if n%2==0:
    print(n*(n-1)*(n-3))
else:
    print(n*(n-1)*(n-2))