#include<bits/stdc++.h>
using namespace std;
int N,xb,yb,xm,ym,ans=INT_MAX,gone[1001][1001];
int m[1001][1001];
int way[4][2]={{-1,0},{0,-1},{0,1},{1,0}};
bool legal(int x,int y)
{
    if(gone[x][y]==-1||x>=xm||y>=ym) return false;
    return true;
}
void dfs(int x,int y,int cnt)
{
    if(cnt>ans) return;
    if(x==0||y==0) 
    {
        ans=cnt;
        return;
    }
    for(int i=0;i<4;++i)
    {
        int xx=x+way[i][0],yy=y+way[i][1];
        if(legal(xx,yy))
        {
            if(m[xx][yy]==1)
            {
            gone[xx][yy]=-1;    
            dfs(xx,yy,cnt+1);
            }
            else
            {
            gone[xx][yy]=-1;    
            dfs(xx,yy,cnt);
            }
        }
    }
    return;
}
int main()
{
    freopen("tractor.in","r",stdin);
    freopen("tractor.out","w",stdout);
    cin>>N>>xb>>yb;
    gone[xb][yb]=-1;
    for(int i=1;i<=N;++i)
    {
        int x,y;
        cin>>x>>y;
        if(x>xm) xm=x;
        if(y>ym) ym=y;
        m[x][y]=1;
    }
    dfs(xb,yb,0);
    cout<<ans;
    return 0;
}