#include<iostream>
using namespace std;
int w, m, n;//w:排长 m:小 n:大
int a[10010][10010];
int main()
{
cin >> w >> m >> n;
if (m > n) { swap(n, m); }
int num = 1;
//先给数组赋值
for (int i = 1; i <= n/w+1; i++)
{
if (i % 2 != 1)//偶数行
{
for (int j = w; j >= 1; j--)
{
a[i][j] = num;
num++;
}
}
if(i % 2 == 1)//奇数行
{
for (int j = 1; j <= w; j++)
{
a[i][j] = num;
num++;
}
}
}
int i_m=0, j_m=0, i_n=0, j_n=0;
//寻找要求的楼号并且记下下标
for (int i = 1; i <= n/w+1; i++)
{
for (int j = 1; j <= w; j++)
{
if (a[i][j] == m)
{
i_m = i;
j_m = j;
}
if (a[i][j] == n)
{
i_n = i;
j_n = j;
}
}
}
//根据下标来计算相对最短距离
cout << abs(i_n - i_m) + abs(j_n - j_m) << endl;
return 0;
}