Problem Description


XY is playing a game:there are N pillar in a row,which numbered from 1 to n.Each pillar has a jewel.Now XY is standing on the S-th pillar and the exit is in the T-th pillar.XY can leave from the exit only after they get all the jewels.Each time XY can move to adjacent pillar,or he can jump to boundary ( the first pillar or the N-th pillar) by using his superpower.However,he needs to follow a rule:if he left the pillar,he no can not get here anymore.In order to save his power,XY wants to use the minimum number of superpower to pass the game.


 



Input


There are multiple test cases, no more than 1000 cases.
For each case,the line contains three integers:N,S and T. (1≤N≤10000,1≤S,T≤N)


 



Output


The output of each case will be a single integer on a line: the minimum number of using superpower or output -1 if he can't leave.


 



Sample Input 


4 1 4
4 1 3


 



Sample Output


0 1



简单题，判断一下各种情况就好了 


#include<cstdio>
#include<cmath>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int maxn = 300005;
int T, n, s, t;

int main()
{
    //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 (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 || s == t - 1) printf("1\n");
        else printf("2\n");
    }
    return 0;
}