#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,x,y,xt,yt;
int dx,dy;
int sum=0;
const int MAXX=2500;
bool map[MAXX+100][MAXX+100];
bool ynfind=false;

int main()
{
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	memset(map,0,sizeof(map));
	cin>>n>>x>>y>>xt>>yt;
	for(int k=1;k<=n;k++)
	{
		if(map[x][y]==0)
		{
			sum++;
			map[x][y]=1;
		}
		cin>>dx>>dy;
		if((x==xt)&&(y==yt)){ynfind=true;break;}
		else {x+=dx;y+=dy;}
		//cout<<x<<' '<<y<<endl;
	}
	if(ynfind==true) cout<<sum<<endl;
	else if(ynfind==false) cout<<"SingleDogMZX"<<endl;
	return 0;
}