#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <set>
#include <list>
#include <queue>
#include <map>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
int n,s,t;

int main()
{
    int T,C = 1;
    //printf("%d\n",2<<1|1);
    //scanf("%d",&T);
    while(scanf("%d%d%d",&n,&s,&t) != EOF)
    {
        if(n == 1)
            printf("0\n");
        else if(s == t)
            printf("-1\n");
        else
        {
            if(t == 1 || t == n)
            {
                if(s == 1 || s == n)
                    printf("0\n");
                else if(s - 1 == t || s + 1 == t)
                    printf("1\n");
                else
                    printf("2\n");
            }
            else
            {
                if(s == 1 || s == n || s - 1 == t || s + 1 == t)
                    printf("1\n");
                else
                    printf("2\n");
            }
        }
    }
    return 0;
}