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 gc
import math
from collections import Counter, deque, defaultdict
from sys import stdout
import time
from math import factorial, log, gcd
import sys
from decimal import Decimal
import threading
from heapq import *


def S():
    return sys.stdin.readline().split()


def I():
    return [int(i) for i in sys.stdin.readline().split()]


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


def IS():
    return sys.stdin.readline().replace('\n', '')


def get_r(n):
    c = [0] * 10 ** 6
    for i in range(2, 1 + int(n ** 0.5 + 1)):
        while n % i == 0:
            c[i] += 1
            n //= i
    return c


def main():
    n = II()
    if n < 3:
        print(n)
        return
    if n % 2 == 1:
        a, b, c = n, n - 1, n - 2
    else:
        a, b, c = n, n - 1, n - 3
    ab = a * b // gcd(a, b)
    abc = ab * c // gcd(ab, c)
    print(abc)


if __name__ == '__main__':
    # for _ in range(II()):
    #     main()
    main()
