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.
ans = 1


def gcd(a, b):
    if b == 0:
        return a
    else:
        return gcd(b, a % b)


def solve():
    global ans
    n = int(input())
    for i in range(0, 50):
        for j in range(0, 50):
            for k in range(0, 50):
                a = n - i
                b = n - j
                c = n - k
                if gcd(a, b) == 1 and gcd(b, c) == 1 and gcd(a, c) == 1:
                    if a * b * c > ans:
                        print(a, b, c)
                        ans = a * b * c


if __name__ == '__main__':
    solve()
    print(ans)

 	 									  	  		 	  		 	 			