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.
#  =========     /\       /|    |====/|
#      |        /  \       |    |   / |
#      |       /____\      |    |  /  |
#      |      /      \     |    | /   |
#  ========= /        \  =====  |/====|  
#  code
from math import gcd
if __name__ == "__main__":
    n = int(input())
    if n == 1:
        print(1)
    elif n == 2:
        print(2)
    elif n == 3:
        print(6)
    elif n == 4:
        print(12)

    elif n%2 == 1:
        print(n*(n-1)*(n-2))
    else:
        ans = n * (n-1) * ((n-2)//2)
        j = n - 3
        while j >= 1:
            ans = max(n*(n-1)*j)
            j -= 2
            if gcd(j,n) > 1:
                break
        print(ans)

    