#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
using namespace std;
long long n,x,y,xt,yt,dx,dy,sum=0;
bool fx[100010],fy[100010];
bool flag=0;
int main()
{
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	memset(fx,0,sizeof(fx));
	memset(fy,0,sizeof(fy));
	cin>>n>>x>>y>>xt>>yt;
	for(int i=1;i<=n;i++)
	{
		cin>>dx>>dy;
		x=x+dx;
		y=y+dy;
		if(fx[x+3000]==0||fy[y+3000]==0) sum++;
		fx[x+3000]=1;
		fx[y+3000]=1;
		if(x==xt&&y==yt)
		{
			cout<<sum<<endl;
			flag=1;
			break;
		}
	}
	if(flag==0) cout<<"SingleDogMZX"<<endl;
	fclose(stdin);
	fclose(stdout);
	return 0;
}