#include<bits/stdc++.h>
using namespace std;
int n,ox,oy,g[1010][1010],ans[1010][1010],e[1010][1010],c[]={1, -1, 0, 0}, d[]={0, 0, -1, 1};
deque<pair<int, int> > q;
int main()
{
	freopen("tractor.in","r",stdin);
	freopen("tractor.out","w",stdout);
    memset(ans,0x3f,sizeof(ans));
    cin>>n>>ox>>oy;
    for(int i=1;i<=n;i++)
	{
    	int x,y;
        cin>>x>>y;
        g[x][y]=1;
    }
    q.push_back(make_pair(ox,oy));
    ans[ox][oy]=0;
	e[ox][oy]=1; 
    while(q.size()!=0)
	{
        int x=q.front().first,y=q.front().second;
		q.pop_front();
        if(x==0&&y==0)
		{
            cout<<ans[0][0]<<endl;  
            return 0;
        }
        for(int i=0;i<4;i++){
            int x0=x+c[i],y0=y+d[i];
            if(x0<0||x0>1001||y0<0||y0>1001||e[x0][y0]!=0)
            	continue;
            e[x0][y0]=1;
            ans[x0][y0]=ans[x][y]+g[x0][y0];
            if(g[x0][y0]!=0)
            	q.push_back(make_pair(x0,y0));
            else
            	q.push_front(make_pair(x0,y0));
        }
    }
    return 0;
}