#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm> 
#include<map>
using namespace std;
int n,fx,fy,endx,endy,ans;
struct Point{
	int x,y;              
	Point(){;}
	Point(int a,int b){x=a;y=b;}
	bool operator<(const Point&A)const{
		if(A.x==x)return y<A.y;
		return x<A.x;
	}
};
map<Point,int> m;
int main()
{
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	scanf("%d",&n);
	scanf("%d%d%d%d",&fx,&fy,&endx,&endy);
	m[Point(fx,fy)]=1;ans++;
	if(fx==endx&&fy==endy){
		printf("%d\n",ans);
		return 0;
	}
	int x,y;
	for(int i=1;i<=n;i++){
		scanf("%d%d",&x,&y);
		fx+=x;fy+=y;
		if(m[Point(fx,fy)]!=1){
			m[Point(fx,fy)]=1;
			ans++;
		}
		if(fx==endx&&fy==endy){
			printf("%d\n",ans);
			return 0;
		}
	}
	puts("SingleDogMZX");
	return 0;
	fclose(stdin);fclose(stdout);
	return 0;
}