#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<ctime>
#include<algorithm>
#include<cmath>
#include<map>
#define pii pair<int,int>
using namespace std;
int n,sx,sy,ex,ey,ans,X[1000010],Y[1000010];
map<pii,int>mp;
char buf[1<<15],*fs,*ft;
inline char getc() {return (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<15,stdin),fs==ft))?0:*fs++;}
inline int read()
{
	int x=0,f=1;  char ch=getc();
	while(!isdigit(ch))  {if(ch=='-')  f=-1;  ch=getc();}
	while(isdigit(ch))  {x=x*10+ch-'0';  ch=getc();}
	return x*f;
}
int main()
{
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	n=read();  sx=read();  sy=read();  ex=read();  ey=read();
	mp[make_pair(sx,sy)]=1;
	ans++;
	for(int i=1;i<=n;i++)  X[i]=read(),Y[i]=read();
	for(int i=1;i<=n;i++)
	{
		sx+=X[i],sy+=Y[i];
		if(mp[make_pair(sx,sy)]!=1)  mp[make_pair(sx,sy)]=1,ans++;
		if(sx==ex&&sy==ey)  {printf("%d\n",ans);return 0;}
	}
	printf("SingleDogMZX\n");
	return 0;
}