18 December A Game of LCM

class Solution {
        long maxGcd(long n) {
        return Math.max(lcm(n),lcm(n-1));
     }
    long lcm(long n) {
         long ans = n*(n-1);
         int cnt=0;
     for(long i=n-2;i>=1;i--) {
        long f = gcd(ans,i);
             if(f==1) {
                 ans*=i;
                 cnt++;
             }
        if(cnt==2) return ans;
        }
         return ans;
     }
    long gcd(long a, long b) {
         if (b == 0)return a;
         return gcd(b, a % b);

     }
}