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 math


def ii(): return int(input())


def ill(): return input().split(' ')


def ili(): return [int(i) for i in input().split(' ')]


def ilis(): return (int(i) for i in input().split(' '))


def gcd(a, b): return a if b == 0 else gcd(b, a % b)


def extgcd(a, b, x=0, y=0):
    if b == 0:
        return (a, 1, 0)
    d, m, n = extgcd(b, a % b, x, y)
    return (d, n, m-(a//b)*n)


def main():
    T = ii()
    a = T
    b = a - 1
    c = b - 1
    d = gcd(a, c)
    print(b*a*c//d)


if __name__ == "__main__":
    main()
