#include <iostream>
#include <cstdio>
#include <cstring>
#include <set>
#include <map>
#include <stack>
#include <vector>
#include <string>
#include <queue>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
const int mod = int(1e9) + 7, INF = 0x3fffffff, maxn = 1e5 + 40;
typedef long long ll;
int n, s, t;

int main(void) {
    /*int T;
    scanf("%d", &T);
    for (int cas = 1; cas <= T; cas++) {
        
    }*/
    while (~scanf("%d%d%d", &n, &s, &t)) {
        if (n == 1 && s == t) puts("0");
        else if (s == t) puts("-1");
        else {
            if ((s == 1 && n == t) || (s == n && t == 1)) puts("0");
            else if (abs(s - t) == 1) puts("1");
            else if (s == 1 || s == n) puts("1");
            else puts("2");
        }
    }
    return 0;
}