#include <stdio.h>

int main(void) {

int n,m,k=0,j,cond=0;

int p,factor,prime,q,highest=0,i;

scanf ("%d%d", &n ,&m);

p = n +m;

while (p!=2)

{

if(p%2==0)

	p = p/2;



else

{

	q = 3*p +1;

	i=q-1;	// edited

	while (i>1)	//edited

	{

		if (q%i==0)

		{  cond =0;

		   factor = i;

		   //for (j=2;j<=(factor/2);++j)
             for (j=2; j * j <= factor; ++j)
			{

		           if (factor%j==0)

		             {

				cond = 1;

				break;

					 }

  			  }

	              if (cond==0)

			{
                   p = i;	//add
                   break;	//add
				//prime = factor;

				//if (prime>highest)

				//highest = prime;

			 }


		   }

			i--;

			}

		    //edited }
        }
		//p = highest;

			 k++;

				 }

 //if (p==2)

  printf ("%d\n",k);
  return 0;
}