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;
#define ll long long int
int main()
{

    ll n ;//= int (input())
    cin>> n;
    if(n<3)//:print(n)
        cout<< n<<endl;
    else if(n%2==0)
        if(n%3 == 0 and (n-3)%3 == 0)
            cout<<((n-1)*(n-2)*(n-3))<<endl;
        else
            cout<<(n*(n-1)*(n-3))<<endl;
    else
        cout<<(n*(n-1)*(n-2))<<endl;

    return 0;
}
