#include <iostream>
#include <cstdio>
#include <set>
using namespace std;
int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){	if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	return x*f;
}
struct data{
	int x,y;
}node[1000050];
bool operator <(data a,data b)
{
	if(a.x!=b.x||a.y!=b.y)
		return 1;
	return 0;
}
set<data>st;
int n,x0,y0,xt,yt;
int dx,dy;
int main()
{
	freopen("loverfinding.in","r",stdin);
	freopen("loverfindint.out","w",stdout);
	n=read();x0=read();y0=read();xt=read();yt=read();
	if(x0==xt&&y0==yt){cout<<1;return 0;}
	node[0].x=x0;node[0].y=y0;
	st.insert(node[0]);	
	for(int i=1;i<=n;i++)
	{
		dx=read();dy=read();
		node[i].x=node[i-1].x+dx;node[i].y=node[i-1].y+dy;
		if(node[i].x==xt && node[i].y==yt)
		{			
			printf("%d",st.size()+1);
			return 0;
		}
		if(st.count(node[i])==0)
		{
			st.insert(node[i]);
		}
	}
	printf("SingleDogMZX\n");
	return 0;
}