#include<map>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define maxn 1000010
using namespace std;
typedef long long LL;
struct Node{
	int x,y;
	Node(){}
	Node(int a,int b){
		x=a;
		y=b;
	}
	bool operator < (const Node &h)const {
		if(h.x!=x) return h.x<x;
		return h.y<y;
	}
};
int n,x0,y0,tox,toy,ans;
map<Node,int> mp;
bool flag;
int main(){
	freopen("loverfinding.in","r",stdin);freopen("loverfinding.out","w",stdout); 
	scanf("%d%d%d%d%d",&n,&x0,&y0,&tox,&toy);
	ans=1;
	if(x0==tox&&y0==toy){
		flag=1;
		ans=1;
	} else {
		for(int i=1;i<=n;i++){
			int d1,d2;scanf("%d%d",&d1,&d2);
			x0+=d1;y0+=d2;
			Node k;
			k.x=x0;k.y=y0;
			//printf("ans=%d x0=%d y0=%d\n",ans,x0,y0);
			if(mp.count(k)==1)ans--;
			ans++;
			mp[k]=i;
			
			if(x0==tox&&y0==toy){
				flag=1;
				break;
			}
		}
	}
	if(flag) printf("%d\n",ans);
	else printf("SingleDogMZX\n");
	getchar();getchar();
	//while(1);
	return 0;
}