#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
const int N = 10010;


typedef pair<int,int> PII;
PII  p[N+N];

int w,m,n;

int main()
{
    cin >> w >> m >> n ;
    int index = 1;
    for(int i = 1 ; i <= max(m,n)/w + 1 ; i++)
    {
        if(i % 2 == 1)
        {
            for(int j = 1; j <= w; j++)
            {
                p[index++] = {i,j}; 
            }            
        }

        else
        {
            for(int j = w; j >= 1; j--)
            {
                p[index++] = {i,j};
            }            
        }

    }
    int outcome = abs(p[m].first - p[n].first) + abs(p[m].second - p[n].second);
    cout << outcome << endl;
}