#include<bits/stdc++.h>
using namespace std;
map<pair<int,int>,long long>dp;
long long fn(int m,int n)
{//cout<<m<<"   "<<n<<endl;
	if(m==1)return n-1;
	if(n==1)return m-1;
	if(dp.find(make_pair(m,n))!=dp.end())return dp[make_pair(m,n)];
	long long ans1=1e18,ans2=1e18;
	if(m>1)ans1=1+fn(m/2,n)+fn(m-m/2,n);
	if(n>1)ans2=1+fn(m,n/2)+fn(m,n-n/2);
	return dp[make_pair(m,n)]=min(ans1,ans2);
}
int main()
{
	int n,m;
	cin>>n>>m;
	cout<<fn(n,m);
}