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 threading, sys

def main():
    def gcd(a, b):
        if b == 0:
            return a
        else:
            return gcd(b, a % b)
    
    n = int(input())
    
    if n%2:
        print(n*(n-1)*(n-2))
    elif gcd(n, n-3) == 1:
        print(n*(n-1)*(n-3))
    else:
        print((n-1)*(n-2)*(n-3))
        
    
if __name__ == '__main__':
    sys.setrecursionlimit(1 << 30)
    threading.stack_size(1 << 27)

    main_thread = threading.Thread(target=main)
    main_thread.start()
    main_thread.join()