#include<bits/stdc++.h>
using namespace std;
int bx,by,mp[1010][1010],n,mxx,mxy,mnx=0x3f3f3f3f,mny=0x3f3f3f3f,ans=0x3f3f3f3f,f[1010][1010];
int dx[6]={0,1,0,-1,0},dy[6]={0,0,1,0,-1};
bool v[1010][1010];
int dfs(int x,int y,int u){
    if(u>=f[x][y])return 0;
    if(f[x][y]==0x3f3f3f3f)f[x][y]=u;
    if(u>=ans)return 0;
    if(x==mxx||y==mxy||x==mnx||y==mny){
        ans=min(ans,u);
        return 0;
    }
    for(int i=1;i<=4;i++){
        if(v[x+dx[i]][y+dy[i]]==0){
            v[x+dx[i]][y+dy[i]]=1;
            dfs(x+dx[i],y+dy[i],u+mp[x+dx[i]][y+dy[i]]);
            v[x+dx[i]][y+dy[i]]=0;
        }
    }
    return 0;
}
int main(){
    freopen("tractor.in","r",stdin);
    freopen("tractor.out","w",stdout);
    cin>>n>>bx>>by;
    memset(f,0x3f,sizeof(f));
    for(int i=1;i<=n;i++){
        int x,y;
        cin>>x>>y;
        mp[x][y]++;
        mxx=max(mxx,x);
        mxy=max(mxy,y);
        mnx=min(mnx,x);
        mny=min(mny,y);
    }
    dfs(bx,by,0);
    cout<<ans+mp[1][1]<<endl;
    return 0;
}