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.
'''
Author:Fuad Ashraful Mehmet
'''


class LCM_Challange:
    def __init__(self,n):
        self.n=n

    def solve(self):
        
        if self.n<3:
            return self.n  

        if self.n%6==0:
            return (self.n-1)*(self.n-2)*(self.n-3)
        elif self.n%2==0:
            return self.n*(self.n-1)*(self.n-3)
        else:
            return self.n*(self.n-1)*(self.n-2)

obj=LCM_Challange(int(input()))
print(obj.solve())
