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.

#                                 ██╗  ██╗ █████╗ ██╗     ██████╗  ███████╗ ████████╗ ██╗  ██╗ 
#                                 ██║ ██╔╝██╔══██╗██║     ██╔══██╗ ██╔════╝ ██ ╔════╝ ██║  ██║ 
#                                 █████╔╝ ███████║██║     ██║  ██║ █████╗   ████████║ ███████║ 
#                                 ██╔═██╗ ██╔══██║██║     ██║  ██║ ██╔══╝   ╔════╝██║ ██╔══██║ 
#                                 ██║  ██╗██║  ██║███████╗██████╔╝ ███████╗ ████████║ ██║  ██║ 
#                                 ╚═╝  ╚═╝╚═╝  ╚═╝╚══════╝╚═════╝  ╚══════╝ ╚══════╝╚ ═╝   ╚═╝ 

MOD = int(1e9)+7
from math import sqrt,ceil,log,log2,\
floor,gcd,pi,factorial,lcm
from collections import deque
from itertools import permutations



def solve():
  if n<3:
    print(n)
  else:
    print(lcm(n,n-1,n-2))

if __name__=='__main__':
  n =int(input())
  solve()