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 itertools import permutations
from fractions import gcd
n = int(input())
if n <= 3:
  print([0,1,2,6][n])
else:
  best = 0
  for permutation in permutations(range(n, max(n-50, 0),-1), 3):
    a,b,c = permutation
    g = a * b / gcd(a, b)
    g = g * c / gcd(g, c)
    best = max(best, g)
  print(int(best))
