#include <stdio.h>

 #include <string.h>

 #include <iostream>

 #include <string>

 #include <math.h>

 #include <algorithm>

 #include <vector>

 #include <stack>

 #include <queue>

 #include <set>

 #include <map>

 #include <sstream>

 const int INF=0x3f3f3f3f;

 typedef long long LL;

 const int mod=1e9+;

 const double PI = acos(-);

 #define Bug cout<<"---------------------"<<endl

 const int maxn=1e4+;

 using namespace std;

 int vis[];

 int main()

 {

     #ifdef DEBUG

     freopen("sample.txt","r",stdin);

     #endif

     ios_base::sync_with_stdio(false);

     cin.tie(NULL);

     int n,a,b;

     scanf("%d %d %d",&n,&a,&b);

     int ans=;

     if(a>=b)

     ans=a-b;

     else //BFS

     {

         queue<pair<int,int> > qe;

         vis[a]=;

         qe.push(make_pair(a,));

         while(!qe.empty())

         {

             int now=qe.front().first;

             int step=qe.front().second;

             qe.pop();

             if(now==b)//找到了

             {

                 ans=step;

                 break;

             }

             int to;

             to=now+;//前进1步

             if(to>=&&to<=n&&!vis[to])

             {

                 vis[to]=;

                 qe.push(make_pair(to,step+));

             }

             to=now-;//后退1步

             if(to>=&&to<=n&&!vis[to])

             {

                 vis[to]=;

                 qe.push(make_pair(to,step+));

             }

             to=now*;//跳跃一步

             if(to>=&&to<=n&&!vis[to])

             {

                 vis[to]=;

                 qe.push(make_pair(to,step+));

             } 

         }

     }

     printf("%d\n",ans);

     return ;

 }