#include<cstdio>
#include<set>
#include<iostream>
#include<cstdlib>
using namespace std;
int bx,by,ex,ey,n,x,y,cnt;
struct Node{
	int x,y;
	Node(int a=0,int b=0): x(a) , y(b) {} ;
	bool operator <(const Node w) const{
		if(w.x!=x)return w.x<x;
		else return w.y<y;
	}
};
set<Node> s;
int main(){
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	scanf("%d%d%d%d%d",&n,&bx,&by,&ex,&ey);
	++cnt;
	if(bx==ex&&by==ey){puts("1");goto END ;}
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d",&x,&y);
		bx+=x,by+=y;
		if(!s.count( Node(bx,by) )){
			++cnt;
			s.insert(Node(bx,by));
		}
		if( bx == ex && by == ey )
		{
			printf("%d\n",cnt);
			goto END ;
		}
	}
	printf("SingleDogMZX\n");
	END:
		return 0;
}