#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
class poi
{
public:
	int x,y;
	bool operator < (const poi p) const
	{
		return x==p.x?y<p.y:x<p.x;
	}
};
int n,sx,sy,ex,ey;
int ans=1;
int opx=0,opy=0;
int tmpx=0,tmpy=0;
map<poi ,bool > MP;
void PreDo()
{
	scanf("%d%d%d%d%d",&n,&sx,&sy,&ex,&ey);
	tmpx=sx,tmpy=sy;
	MP[(poi){sx,sy}]=1;
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d",&opx,&opy);
		tmpx+=opx;
		tmpy+=opy;
		if(!MP[(poi){tmpx,tmpy}])
		{
			ans++;
		}
		MP[(poi){tmpx,tmpy}]=1;
		if(tmpx==ex&&tmpy==ey)
		{
			break;
		}
	}
	if(!MP[(poi){ex,ey}])
	{
		printf("SingleDogMZX\n");
	}
	else
	{
		printf("%d\n",ans);
	}
}
int main()
{
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	PreDo();
	return 0;
}