#include<cstdio>
#include<map>
#include<iostream>
using namespace std;
bool a[5001][5001];
int n,x0,y0,x1,y1;
long long ans=1;
int main()
{
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	int i,j,x,y;
	scanf("%d%d%d%d%d",&n,&x0,&y0,&x1,&y1);
	x0+=2500;
	y0+=2500;
	x1+=2500;
	y1+=2500;
	a[x0][y0]=1;
	for(i=1;i<=n;i++)
	{
		scanf("%d%d",&x,&y);
		x0=x0+x,y0=y0+y;
		if(a[x0][y0])
		  continue;
		ans++;
		a[x0][y0]=1;
		if(x0==x1&&y0==y1)
		{
			cout<<ans;
			return 0;
		}
	}
	printf("SingleDogMZX");
	return 0;
}