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.
class Solution:
    def CalLcm(self,a,b):
        maxm=max(a,b)
        minm=min(a,b)
        if minm==0:
            gcd=maxm
        else:
            while maxm%minm!=0:
                r=maxm%minm
                maxm=minm
                minm=r
            gcd=minm
        lcm=(a*b)/gcd
        return lcm
    def MaxLCM(self,n):
        ans=0
        ob1=Solution()
        if n>=3 and n<=10:
            for i in range(n):
                a=n-i
                b=n-(i+1)
                c=n-(i+2)
                l=ob1.CalLcm(a,b)
                l=ob1.CalLcm(l,c)
                ans=max(ans,l)
        else:
            for i in range(10):
                a=n-i
                b=n-(i+1)
                c=n-(i+2)
                l=ob1.CalLcm(a,b)
                l=ob1.CalLcm(l,c)
                ans=max(ans,l)
        return ans
if __name__=='__main__':
    n=int(input())
    ob=Solution()
    a=ob.MaxLCM(n)
    print(a)
        