#include<iostream>
#include<cstring>
#include<cstdio>
#include<iostream>
#include<cmath>
using namespace std;
int n,xs,ys,xe,ye,x,y;
int flag=1;
bool a[5010][5010];
int main()
{
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	scanf("%d%d%d%d%d",&n,&xs,&ys,&xe,&ye);
	memset(a,false,sizeof(a));
	xs+=2500;ys+=2500;xe+=2500;ye+=2500;
	a[xs][ys]=true;
	x=xs;y=ys;
	for(int i=1;i<=n;i++)
	{
		int tox,toy;
		scanf("%d%d",&tox,&toy);
		x+=tox;y+=toy;
		if(a[x][y]==false) 
		{
			a[x][y]=true;
			flag++;
			if((x==xe)&&(y==ye))
			{
				cout<<flag<<endl;
				return 0;
			}
		}
	}
	cout<<"SingleDogMZX"<<endl;
	return 0;
}