#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,x0,y0,xt,yt,x,y,ans=0;
bool f[5001][5001];
int main()
{
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	memset(f,0,sizeof(f));
	scanf("%d%d%d%d%d",&n,&x0,&y0,&xt,&yt);
	x0+=2500;y0+=2500;xt+=2500;yt+=2500;
	f[x0][y0]=1;ans++;
	for(int i=1;i<=n;i++)
	{
		if(x0==xt&&y0==yt)
		{
			printf("%d\n",ans);
			return 0;
		}
		scanf("%d%d",&x,&y);
		x0+=x;y0+=y;	
		if(!f[x0][y0]) f[x0][y0]=1,ans++;
	}
	printf("SingleDogMZX\n");
	return 0;
}