#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
using namespace std;
int flag=0;
int f[5002][5002]={};
int main()
{
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	int n,xo,yo,xt,yt;
	int num=1;
	cin>>n>>xo>>yo>>xt>>yt;
	xo+=2500;
	yo+=2500;
	xt+=2500;
	yt+=2500;
	for(int i=1;i<=n;i++)
	{
		int dx,dy;
		cin>>dx>>dy;
		xo=xo+dx;
		yo=yo+dy;
		if(xo==xt&&yo==yt){flag=1;break;}
		if(f[xo][yo]==0)
		{
			num++;
			f[xo][yo]=1;
		}
	}	
	if(flag==1)cout<<num+1<<endl;
	else cout<<"SingleDogMZX"<<endl;
		return 0;
}