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.
def main():    
    def lcm(A,B):   
        if A>B:
            big=A
            small=B
        else:
            big=B
            small=A
        while(big%small!=0):
            flag=small
            small=big%small
            big=flag

        return int((A*B)/small)
    x=int(input())
    y=lcm(x,x-1)
    ans=lcm(y,x-2)
    print(ans)
if __name__ == "__main__":
    main()