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.
#include <bits/stdc++.h>
using namespace std;
int  gcd(int a,int b)
{
    if (a==0)
        return b;
    return gcd(b%a,a);
}
int main()
{
    std::ios::sync_with_stdio(false);
    int n;
    cin>>n;
    long long  ans=n;
    long long cur=n;
    int gt;
    for(int i=1;i<n;i++)
    {
        if((ans*i)/gcd(ans,i)>cur)
        {
            cur=(ans*i)/gcd(ans,i);
            gt=i;
        }
    }
    ans=cur;
    for(int i=1;i<n;i++)
    {
        if(gt==i) continue;
        if((ans*i)/gcd(ans,i)>cur)
            cur=(ans*i)/gcd(ans,i);
    }
    cout<<cur;
    return 0;
}