#pragma GCC optimize("03")
#include <bits/stdc++.h>

using namespace std;

#define int long long

const int sz=2e5+5;
const int INF=1e9;

void solve()
{    
    int n,k;
    
    k=0;
    
    cin>>n>>k;
    
    //for(n=2;n<=100;n++)
    //{
        int s=n*n;
        
        char arr[n][n];
        
        if(!k)
        {
            for(int i=0;i<n;i++)
                for(int j=0;j<n;j++)
                    arr[i][j]='W';
            
            vector<int> divisors;
            
            for(int i=1;i<=n;i++)
                if(n%i==0)
                    divisors.push_back(i);
            
            int ans=INF;
            
            for(int i=0;i<divisors.size();i++)  
            {
                int lcl_ans;
                    
                if(divisors[i]<=(n/2))
                {
                    int lcl=divisors[i]*divisors[i];
                    
                    int k=s/lcl;
                    
                    lcl_ans=k/2;
                    
                    lcl_ans*=lcl;
                }
                    
                ans=min(ans,lcl_ans);
            }
            
            cout<<ans<<endl;
        }
    //}
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    //freopen("cowtip.in","r",stdin);
    
    //freopen("cowtip.out","w",stdout);
    
    int t=1;
    
    //cin>>t;
    
    while(t--)
    {
        solve();
    }
}