#include<iostream>
#include<cstdio>
#include<cctype>
#include<vector>
#include<algorithm>
using namespace std;
int n,x[2],y[2],ans=1,zx,zy;
struct desk{
	int x,y;
	bool operator < (const desk b) const{
		return x==b.x? y<b.y:x<b.x;
	}
};
vector<desk> d;
inline void in(int &x){
    x=0;int f=1;char t=getchar();
    while(!isdigit(t)){if(t=='-')f=-1;t=getchar();}
    while(isdigit(t)){x=x*10+t-48;t=getchar();}
    x*=f;
}
inline int work(){
	in(n);in(x[0]);in(y[0]);in(x[1]);in(y[1]);
	desk zz;
	zz.x=x[0];
	zz.y=y[0];
	d.push_back(zz);
	if(x[0]==x[1]&&y[0]==y[1]){
		printf("%d",ans);
		return 0;
	}
	while(n--){
		in(zx);in(zy);
		x[0]=x[0]+zx;
		y[0]=y[0]+zy;
		desk zz;
		zz.x=x[0];
		zz.y=y[0];
	  	d.push_back(zz);
	  	if(x[0]==x[1]&&y[0]==y[1]){
		  	ans=0;
			break;
		}
	}
	if(ans) printf("SingleDogMZX");
	else{
	  	n=d.size();
	  	sort(d.begin(),d.end());
	  	for(int i=0;i<n;i++){
	  		while(d[i].x==d[i+1].x&&d[i].y==d[i+1].y) i++;
	  		ans++;
	  	}
		printf("%d",ans);
	}
	return 0;
}
inline int mian(){
	freopen("loverfinding.in", "r", stdin);
    freopen("loverfinding.out", "w", stdout);
    work();
}
int niconiconi=mian();
int main(){;}