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.
# LUOGU_RID: 101043146
def gcd(a,b):
    while b!=0:
        a,b=b,a%b
    return a
def prime(a,b):
    return gcd(a,b)==1
n=int(input())
if n&1:
    print(n*(n-1)*(n-2))
else:
    if prime(n,n-3):
        print(n*(n-1)*(n-3))
    else:
        print((n-1)*(n-2)*(n-3))
