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.
n=int(input())
def gcd(a,b):
    maxi=max(a,b)
    mini=min(a,b)
    if(mini==0):
        return maxi
    while(maxi%mini):
        tmp=maxi
        maxi=mini
        mini=tmp%mini
    return mini
tmp=n
gc=n
cnt=1
    
for i in range(n-1,0,-1):
    tp=gcd(n,i)
    if(cnt==3):
        break
    if(tp==1):
        
        tmp*=i
        cnt+=1
print(tmp)