#include<iostream>
#include<cstdio>
#include<cstring>
#include<set>
using namespace std;
struct Node{
	int x,y;
	Node(int x1,int y1){
		x=x1;y=y1;
	}
	bool operator<(const Node&a)const{
		if(x<a.x)return 1;
		if(x>a.x)return 0;
		return y<a.y;
	}
};
set<Node>s;
int main(){
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	int n,x1,y1,x2,y2;
	scanf("%d%d%d%d%d",&n,&x1,&y1,&x2,&y2);
	bool get=0;
	int cnt=0;
	if(x1==x2&&y1==y2){
		printf("1");
		return 0;
	}
	cnt++;	int xx,yy;
	s.insert(Node(x1,y1));
	for(int i=1;i<=n;i++){
		scanf("%d%d",&xx,&yy);
		x1+=xx;y1+=yy;
		if(!s.count(Node(x1,y1))){
			cnt++;
			s.insert(Node(x1,y1));
		}
		if(x1==x2&&y1==y2){
			get=1;
			break;
		}
	}
	if(!get)printf("SingleDogMZX");
	else printf("%d",cnt);
	fclose(stdin);
	fclose(stdout);
    return 0;
}