#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
#define M 10009
#define INF 0x3f3f3f3f
int n,s,t;
bool vis[M];
int ans ;
int main()
{
    while(scanf("%d %d %d",&n,&s,&t) == 3)
    {
        memset(vis,false,sizeof(vis));
        ans = INF;
        if(n == 1 && s==t) printf("0\n");
        else if(s == t)
        {
            printf("-1\n");
        }
        else if((s==1&&t==n) || (s==n&&t==1))
        {
            printf("0\n");
        }
        else if((s==1 && t != n) || (s==n && t!=1))
        {
            printf("1\n");
        }
        else if((s-t==1) || (t-s==1)) printf("1\n");
        else if((s != 1) || (s != n))
        {
            printf("2\n");
        }

    }
    return 0;
}